[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.221 by root, Thu Apr 24 12:06:01 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)
…		…
852	object::destroy_inv (bool drop_to_ground)	918	object::destroy_inv (bool drop_to_ground)
853	{	919	{
854	// need to check first, because the checks below might segfault	920	// need to check first, because the checks below might segfault
855	// as we might be on an invalid mapspace and crossfire code	921	// as we might be on an invalid mapspace and crossfire code
856	// is too buggy to ensure that the inventory is empty.	922	// is too buggy to ensure that the inventory is empty.
857	// corollary: if you create arrows etc. with stuff in tis inventory,	923	// corollary: if you create arrows etc. with stuff in its inventory,
858	// cf will crash below with off-map x and y	924	// cf will crash below with off-map x and y
859	if (!inv)	925	if (!inv)
860	return;	926	return;
861		927
862	/* Only if the space blocks everything do we not process -	928	/* Only if the space blocks everything do we not process -
…		…
869	\|\| map->nodrop	935	\|\| map->nodrop
870	\|\| ms ().move_block == MOVE_ALL)	936	\|\| ms ().move_block == MOVE_ALL)
871	{	937	{
872	while (inv)	938	while (inv)
873	{	939	{
874	inv->destroy_inv (drop_to_ground);	940	inv->destroy_inv (false);
875	inv->destroy ();	941	inv->destroy ();
876	}	942	}
877	}	943	}
878	else	944	else
879	{ /* Put objects in inventory onto this space */	945	{ /* Put objects in inventory onto this space */
…		…
885	\|\| op->flag [FLAG_NO_DROP]	951	\|\| op->flag [FLAG_NO_DROP]
886	\|\| op->type == RUNE	952	\|\| op->type == RUNE
887	\|\| op->type == TRAP	953	\|\| op->type == TRAP
888	\|\| op->flag [FLAG_IS_A_TEMPLATE]	954	\|\| op->flag [FLAG_IS_A_TEMPLATE]
889	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	955	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
890	op->destroy ();	956	op->destroy (true);
891	else	957	else
892	map->insert (op, x, y);	958	map->insert (op, x, y);
893	}	959	}
894	}	960	}
895	}	961	}
…		…
902	}	968	}
903		969
904	void	970	void
905	object::do_destroy ()	971	object::do_destroy ()
906	{	972	{
907	attachable::do_destroy ();
908
909	if (flag [FLAG_IS_LINKED])	973	if (flag [FLAG_IS_LINKED])
910	remove_button_link (this);	974	remove_button_link (this);
911		975
912	if (flag [FLAG_FRIENDLY])	976	if (flag [FLAG_FRIENDLY])
913	remove_friendly_object (this);	977	remove_friendly_object (this);
914		978
915	if (!flag [FLAG_REMOVED])
916	remove ();	979	remove ();
917		980
918	destroy_inv (true);	981	attachable::do_destroy ();
919		982
920	deactivate ();	983	deactivate ();
921	unlink ();	984	unlink ();
922		985
923	flag [FLAG_FREED] = 1;	986	flag [FLAG_FREED] = 1;
…		…
964	object::destroy (bool destroy_inventory)	1027	object::destroy (bool destroy_inventory)
965	{	1028	{
966	if (destroyed ())	1029	if (destroyed ())
967	return;	1030	return;
968		1031
		1032	if (!is_head () && !head->destroyed ())
		1033	{
		1034	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
		1035	head->destroy (destroy_inventory);
		1036	}
		1037
969	if (destroy_inventory)	1038	destroy_inv (!destroy_inventory);
970	destroy_inv (false);
971		1039
972	if (is_head ())	1040	if (is_head ())
973	if (sound_destroy)	1041	if (sound_destroy)
974	play_sound (sound_destroy);	1042	play_sound (sound_destroy);
975	else if (flag [FLAG_MONSTER])	1043	else if (flag [FLAG_MONSTER])
976	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1044	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
977		1045
978	attachable::destroy ();	1046	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	}	1047	}
997		1048
998	/* op->remove ():	1049	/* op->remove ():
999	* This function removes the object op from the linked list of objects	1050	* 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	1051	* which it is currently tied to. When this function is done, the
…		…
1006	object::do_remove ()	1057	object::do_remove ()
1007	{	1058	{
1008	object tmp, last = 0;	1059	object tmp, last = 0;
1009	object *otmp;	1060	object *otmp;
1010		1061
1011	if (QUERY_FLAG (this, FLAG_REMOVED))	1062	if (flag [FLAG_REMOVED])
1012	return;	1063	return;
1013		1064
1014	SET_FLAG (this, FLAG_REMOVED);
1015	INVOKE_OBJECT (REMOVE, this);	1065	INVOKE_OBJECT (REMOVE, this);
		1066
		1067	flag [FLAG_REMOVED] = true;
1016		1068
1017	if (more)	1069	if (more)
1018	more->remove ();	1070	more->remove ();
1019		1071
1020	/*	1072	/*
1021	* In this case, the object to be removed is in someones	1073	* In this case, the object to be removed is in someones
1022	* inventory.	1074	* inventory.
1023	*/	1075	*/
1024	if (env)	1076	if (env)
1025	{	1077	{
		1078	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1079	if (object *pl = visible_to ())
		1080	esrv_del_item (pl->contr, count);
		1081	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1082
		1083	adjust_weight (env, -total_weight ());
		1084
		1085	*(above ? &above->below : &env->inv) = below;
		1086
1026	if (nrof)	1087	if (below)
1027	sub_weight (env, weight * nrof);	1088	below->above = above;
1028	else	1089
1029	sub_weight (env, weight + carrying);	1090	/* we set up values so that it could be inserted into
		1091	* the map, but we don't actually do that - it is up
		1092	* to the caller to decide what we want to do.
		1093	*/
		1094	map = env->map;
		1095	x = env->x;
		1096	y = env->y;
		1097	above = 0;
		1098	below = 0;
		1099	env = 0;
1030		1100
1031	/* NO_FIX_PLAYER is set when a great many changes are being	1101	/* NO_FIX_PLAYER is set when a great many changes are being
1032	* made to players inventory. If set, avoiding the call	1102	* made to players inventory. If set, avoiding the call
1033	* to save cpu time.	1103	* to save cpu time.
1034	*/	1104	*/
1035	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1105	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1036	otmp->update_stats ();	1106	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	}	1107	}
1055	else if (map)	1108	else if (map)
1056	{	1109	{
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;	1110	map->dirty = true;
1070	mapspace &ms = this->ms ();	1111	mapspace &ms = this->ms ();
		1112
		1113	if (object *pl = ms.player ())
		1114	{
		1115	if (type == PLAYER) // this == pl(!)
		1116	{
		1117	// leaving a spot always closes any open container on the ground
		1118	if (container && !container->env)
		1119	// this causes spurious floorbox updates, but it ensures
		1120	// that the CLOSE event is being sent.
		1121	close_container ();
		1122
		1123	--map->players;
		1124	map->touch ();
		1125	}
		1126	else if (pl->container == this)
		1127	{
		1128	// removing a container should close it
		1129	close_container ();
		1130	}
		1131
		1132	esrv_del_item (pl->contr, count);
		1133	}
1071		1134
1072	/* link the object above us */	1135	/* link the object above us */
1073	if (above)	1136	if (above)
1074	above->below = below;	1137	above->below = below;
1075	else	1138	else
…		…
1105	* removed (most likely destroyed), update the player view	1168	* removed (most likely destroyed), update the player view
1106	* appropriately.	1169	* appropriately.
1107	*/	1170	*/
1108	pl->close_container ();	1171	pl->close_container ();
1109		1172
1110	pl->contr->ns->floorbox_update ();	1173	//TODO: the floorbox prev/next might need updating
		1174	esrv_del_item (pl->contr, count);
1111	}	1175	}
1112		1176
1113	for (tmp = ms.bot; tmp; tmp = tmp->above)	1177	for (tmp = ms.bot; tmp; tmp = tmp->above)
1114	{	1178	{
1115	/* No point updating the players look faces if he is the object	1179	/* No point updating the players look faces if he is the object
…		…
1159	if (!top)	1223	if (!top)
1160	for (top = op; top && top->above; top = top->above)	1224	for (top = op; top && top->above; top = top->above)
1161	;	1225	;
1162		1226
1163	for (; top; top = top->below)	1227	for (; top; top = top->below)
1164	{
1165	if (top == op)
1166	continue;
1167
1168	if (object::can_merge (op, top))	1228	if (object::can_merge (op, top))
1169	{	1229	{
1170	top->nrof += op->nrof;	1230	top->nrof += op->nrof;
1171		1231
1172	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1232	if (object *pl = top->visible_to ())
1173	op->weight = 0; /* Don't want any adjustements now */	1233	esrv_update_item (UPD_NROF, pl, top);
		1234
		1235	op->weight = 0; // cancel the addition above
		1236	op->carrying = 0; // must be 0 already
		1237
1174	op->destroy ();	1238	op->destroy (1);
		1239
1175	return top;	1240	return top;
1176	}	1241	}
1177	}
1178		1242
1179	return 0;	1243	return 0;
1180	}	1244	}
1181		1245
1182	void	1246	void
…		…
1241	object *	1305	object *
1242	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1306	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1243	{	1307	{
1244	assert (!op->flag [FLAG_FREED]);	1308	assert (!op->flag [FLAG_FREED]);
1245		1309
1246	object top, floor = NULL;
1247
1248	op->remove ();	1310	op->remove ();
1249		1311
1250	/* Ideally, the caller figures this out. However, it complicates a lot	1312	/* 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	1313	* of areas of callers (eg, anything that uses find_free_spot would now
1252	* need extra work	1314	* need extra work
1253	*/	1315	*/
1254	if (!xy_normalise (m, op->x, op->y))	1316	if (!xy_normalise (m, op->x, op->y))
1255	{	1317	{
1256	op->destroy ();	1318	op->destroy (1);
1257	return 0;	1319	return 0;
1258	}	1320	}
1259		1321
1260	if (object *more = op->more)	1322	if (object *more = op->more)
1261	if (!insert_ob_in_map (more, m, originator, flag))	1323	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1270	*/	1332	*/
1271	if (op->nrof && !(flag & INS_NO_MERGE))	1333	if (op->nrof && !(flag & INS_NO_MERGE))
1272	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1334	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1273	if (object::can_merge (op, tmp))	1335	if (object::can_merge (op, tmp))
1274	{	1336	{
		1337	// TODO: we atcually want to update tmp, not op,
		1338	// but some caller surely breaks when we return tmp
		1339	// from here :/
1275	op->nrof += tmp->nrof;	1340	op->nrof += tmp->nrof;
1276	tmp->destroy ();	1341	tmp->destroy (1);
1277	}	1342	}
1278		1343
1279	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1344	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1280	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1345	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1281		1346
…		…
1301	/* since below originator, no need to update top */	1366	/* since below originator, no need to update top */
1302	originator->below = op;	1367	originator->below = op;
1303	}	1368	}
1304	else	1369	else
1305	{	1370	{
		1371	object top, floor = NULL;
		1372
1306	top = ms.bot;	1373	top = ms.bot;
1307		1374
1308	/* If there are other objects, then */	1375	/* If there are other objects, then */
1309	if (top)	1376	if (top)
1310	{	1377	{
…		…
1409	}	1476	}
1410		1477
1411	op->map->dirty = true;	1478	op->map->dirty = true;
1412		1479
1413	if (object *pl = ms.player ())	1480	if (object *pl = ms.player ())
1414	pl->contr->ns->floorbox_update ();	1481	//TODO: the floorbox prev/next might need updating
		1482	esrv_send_item (pl, op);
1415		1483
1416	/* If this object glows, it may affect lighting conditions that are	1484	/* If this object glows, it may affect lighting conditions that are
1417	* visible to others on this map. But update_all_los is really	1485	* 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	1486	* 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	1487	* 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.	1529	* op is the object to insert it under: supplies x and the map.
1462	*/	1530	*/
1463	void	1531	void
1464	replace_insert_ob_in_map (const char arch_string, object op)	1532	replace_insert_ob_in_map (const char arch_string, object op)
1465	{	1533	{
1466	object tmp, tmp1;
1467
1468	/* first search for itself and remove any old instances */	1534	/* first search for itself and remove any old instances */
1469		1535
1470	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1536	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1471	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1537	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1472	tmp->destroy ();	1538	tmp->destroy (1);
1473		1539
1474	tmp1 = arch_to_object (archetype::find (arch_string));	1540	object *tmp = arch_to_object (archetype::find (arch_string));
1475		1541
1476	tmp1->x = op->x;	1542	tmp->x = op->x;
1477	tmp1->y = op->y;	1543	tmp->y = op->y;
		1544
1478	insert_ob_in_map (tmp1, op->map, op, 0);	1545	insert_ob_in_map (tmp, op->map, op, 0);
1479	}	1546	}
1480		1547
1481	object *	1548	object *
1482	object::insert_at (object where, object originator, int flags)	1549	object::insert_at (object where, object originator, int flags)
1483	{	1550	{
…		…
1486	else	1553	else
1487	return where->map->insert (this, where->x, where->y, originator, flags);	1554	return where->map->insert (this, where->x, where->y, originator, flags);
1488	}	1555	}
1489		1556
1490	/*	1557	/*
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	1558	* decrease(object, number) decreases a specified number from
1532	* the amount of an object. If the amount reaches 0, the object	1559	* the amount of an object. If the amount reaches 0, the object
1533	* is subsequently removed and freed.	1560	* is subsequently removed and freed.
1534	*	1561	*
1535	* Return value: 'op' if something is left, NULL if the amount reached 0	1562	* Return value: 'op' if something is left, NULL if the amount reached 0
1536	*/	1563	*/
		1564	bool
		1565	object::decrease (sint32 nr)
		1566	{
		1567	if (!nr)
		1568	return true;
		1569
		1570	nr = min (nr, nrof);
		1571
		1572	nrof -= nr;
		1573
		1574	if (nrof)
		1575	{
		1576	adjust_weight (env, -weight * nr); // carrying == 0
		1577
		1578	if (object *pl = visible_to ())
		1579	esrv_update_item (UPD_NROF, pl, this);
		1580
		1581	return true;
		1582	}
		1583	else
		1584	{
		1585	destroy (1);
		1586	return false;
		1587	}
		1588	}
		1589
		1590	/*
		1591	* split(ob,nr) splits up ob into two parts. The part which
		1592	* is returned contains nr objects, and the remaining parts contains
		1593	* the rest (or is removed and returned if that number is 0).
		1594	* On failure, NULL is returned.
		1595	*/
1537	object *	1596	object *
1538	decrease_ob_nr (object *op, uint32 i)	1597	object::split (sint32 nr)
1539	{	1598	{
1540	object *tmp;	1599	int have = number_of ();
1541		1600
1542	if (i == 0) /* objects with op->nrof require this check */	1601	if (have < nr)
1543	return op;	1602	return 0;
1544		1603	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	{	1604	{
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 ();	1605	remove ();
1580	op->nrof = 0;	1606	return this;
1581	if (tmp)
1582	esrv_del_item (tmp->contr, op->count);
1583	}
1584	}	1607	}
1585	else	1608	else
1586	{	1609	{
1587	object *above = op->above;	1610	decrease (nr);
1588		1611
1589	if (i < op->nrof)	1612	object *op = object_create_clone (this);
1590	op->nrof -= i;	1613	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;	1614	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	}	1615	}
1632	}	1616	}
1633		1617
1634	object *	1618	object *
1635	insert_ob_in_ob (object op, object where)	1619	insert_ob_in_ob (object op, object where)
…		…
1660	* be != op, if items are merged. -Tero	1644	* be != op, if items are merged. -Tero
1661	*/	1645	*/
1662	object *	1646	object *
1663	object::insert (object *op)	1647	object::insert (object *op)
1664	{	1648	{
1665	if (!QUERY_FLAG (op, FLAG_REMOVED))
1666	op->remove ();
1667
1668	if (op->more)	1649	if (op->more)
1669	{	1650	{
1670	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1651	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1671	return op;	1652	return op;
1672	}	1653	}
1673		1654
1674	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1655	op->remove ();
1675	CLEAR_FLAG (op, FLAG_REMOVED);	1656
		1657	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1676		1658
1677	if (op->nrof)	1659	if (op->nrof)
1678	{
1679	for (object *tmp = inv; tmp; tmp = tmp->below)	1660	for (object *tmp = inv; tmp; tmp = tmp->below)
1680	if (object::can_merge (tmp, op))	1661	if (object::can_merge (tmp, op))
1681	{	1662	{
1682	/* return the original object and remove inserted object	1663	/* return the original object and remove inserted object
1683	(client needs the original object) */	1664	(client needs the original object) */
1684	tmp->nrof += op->nrof;	1665	tmp->nrof += op->nrof;
1685	/* Weight handling gets pretty funky. Since we are adding to	1666
1686	* tmp->nrof, we need to increase the weight.	1667	if (object *pl = tmp->visible_to ())
1687	*/	1668	esrv_update_item (UPD_NROF, pl, tmp);
		1669
1688	add_weight (this, op->weight * op->nrof);	1670	adjust_weight (this, op->total_weight ());
1689	SET_FLAG (op, FLAG_REMOVED);	1671
1690	op->destroy (); /* free the inserted object */	1672	op->destroy (1);
1691	op = tmp;	1673	op = tmp;
1692	op->remove (); /* and fix old object's links */	1674	goto inserted;
1693	CLEAR_FLAG (op, FLAG_REMOVED);
1694	break;
1695	}	1675	}
1696		1676
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.	1677	op->owner = 0; // it's his/hers now. period.
1713	op->map = 0;	1678	op->map = 0;
		1679	op->x = 0;
		1680	op->y = 0;
		1681
		1682	op->above = 0;
		1683	op->below = inv;
1714	op->env = this;	1684	op->env = this;
1715	op->above = 0;
1716	op->below = 0;
1717	op->x = op->y = 0;
1718		1685
		1686	if (inv)
		1687	inv->above = op;
		1688
		1689	inv = op;
		1690
		1691	op->flag [FLAG_REMOVED] = 0;
		1692
		1693	if (object *pl = op->visible_to ())
		1694	esrv_send_item (pl, op);
		1695
		1696	adjust_weight (this, op->total_weight ());
		1697
		1698	inserted:
1719	/* reset the light list and los of the players on the map */	1699	/* reset the light list and los of the players on the map */
1720	if (op->glow_radius && map)	1700	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);	1701	update_all_los (map, x, y);
1727	}
1728		1702
1729	/* Client has no idea of ordering so lets not bother ordering it here.	1703	// if this is a player's inventory, update stats
1730	* It sure simplifies this function...	1704	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1731	*/	1705	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		1706
1741	INVOKE_OBJECT (INSERT, this);	1707	INVOKE_OBJECT (INSERT, this);
1742		1708
1743	return op;	1709	return op;
1744	}	1710	}
…		…
2622	&name,	2588	&name,
2623	title ? "\",title:\"" : "",	2589	title ? "\",title:\"" : "",
2624	title ? (const char *)title : "",	2590	title ? (const char *)title : "",
2625	flag_desc (flagdesc, 512), type);	2591	flag_desc (flagdesc, 512), type);
2626		2592
2627	if (!this->flag[FLAG_REMOVED] && env)	2593	if (!flag[FLAG_REMOVED] && env)
2628	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2594	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2629		2595
2630	if (map)	2596	if (map)
2631	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2597	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2632		2598
…		…
2662	object::open_container (object *new_container)	2628	object::open_container (object *new_container)
2663	{	2629	{
2664	if (container == new_container)	2630	if (container == new_container)
2665	return;	2631	return;
2666		2632
2667	if (object *old_container = container)	2633	object *old_container = container;
		2634
		2635	if (old_container)
2668	{	2636	{
2669	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2637	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2670	return;	2638	return;
2671		2639
2672	#if 0	2640	#if 0
…		…
2674	if (object *closer = old_container->inv)	2642	if (object *closer = old_container->inv)
2675	if (closer->type == CLOSE_CON)	2643	if (closer->type == CLOSE_CON)
2676	closer->destroy ();	2644	closer->destroy ();
2677	#endif	2645	#endif
2678		2646
		2647	// make sure the container is available
		2648	esrv_send_item (this, old_container);
		2649
2679	old_container->flag [FLAG_APPLIED] = 0;	2650	old_container->flag [FLAG_APPLIED] = false;
2680	container = 0;	2651	container = 0;
2681		2652
		2653	// client needs item update to make it work, client bug requires this to be separate
2682	esrv_update_item (UPD_FLAGS, this, old_container);	2654	esrv_update_item (UPD_FLAGS, this, old_container);
		2655
2683	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2656	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2684	play_sound (sound_find ("chest_close"));	2657	play_sound (sound_find ("chest_close"));
2685	}	2658	}
2686		2659
2687	if (new_container)	2660	if (new_container)
…		…
2700	}	2673	}
2701	#endif	2674	#endif
2702		2675
2703	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2676	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2704		2677
		2678	// make sure the container is available, client bug requires this to be separate
		2679	esrv_send_item (this, new_container);
		2680
2705	new_container->flag [FLAG_APPLIED] = 1;	2681	new_container->flag [FLAG_APPLIED] = true;
2706	container = new_container;	2682	container = new_container;
2707		2683
		2684	// client needs flag change
2708	esrv_update_item (UPD_FLAGS, this, new_container);	2685	esrv_update_item (UPD_FLAGS, this, new_container);
2709	esrv_send_inventory (this, new_container);	2686	esrv_send_inventory (this, new_container);
2710	play_sound (sound_find ("chest_open"));	2687	play_sound (sound_find ("chest_open"));
2711	}	2688	}
		2689	// else if (!old_container->env && contr && contr->ns)
		2690	// contr->ns->floorbox_reset ();
2712	}	2691	}
2713		2692
2714	object *	2693	object *
2715	object::force_find (const shstr name)	2694	object::force_find (const shstr name)
2716	{	2695	{
…		…
2742		2721
2743	insert (force);	2722	insert (force);
2744	}	2723	}
2745		2724
2746	void	2725	void
2747	object::play_sound (faceidx sound) const	2726	object::play_sound (faceidx sound)
2748	{	2727	{
2749	if (!sound)	2728	if (!sound)
2750	return;	2729	return;
2751		2730
2752	if (flag [FLAG_REMOVED])	2731	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.221 by root, Thu Apr 24 12:06:01 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.221 by root, Thu Apr 24 12:06:01 2008 UTC