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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.219 by root, Wed Apr 23 21:09:10 2008 UTC vs.
Revision 1.251 by root, Sun Jul 20 16:56:34 2008 UTC

…		…
139		139
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	141	static bool
142	compare_ob_value_lists_one (const object wants, const object has)	142	compare_ob_value_lists_one (const object wants, const object has)
143	{	143	{
144	key_value *wants_field;
145
146	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	144	/* n-squared behaviour (see kv_get), but I'm hoping both
147	* objects with lists are rare, and lists stay short. If not, use a	145	* objects with lists are rare, and lists stay short. If not, use a
148	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
149	*/	147	*/
150		148
151	/* For each field in wants, */	149	/* For each field in wants, */
152	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	150	for (key_value *kv = wants->key_values; kv; kv = kv->next)
153	{	151	if (has->kv_get (kv->key) != kv->value)
154	key_value *has_field;	152	return false;
155
156	/* Look for a field in has with the same key. */
157	has_field = get_ob_key_link (has, wants_field->key);
158
159	if (!has_field)
160	return 0; /* No field with that name. */
161
162	/* Found the matching field. */
163	if (has_field->value != wants_field->value)
164	return 0; /* Values don't match, so this half of the comparison is false. */
165
166	/* If we get here, we found a match. Now for the next field in wants. */
167	}
168		153
169	/* If we get here, every field in wants has a matching field in has. */	154	/* If we get here, every field in wants has a matching field in has. */
170	return 1;	155	return true;
171	}	156	}
172		157
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static bool	159	static bool
175	compare_ob_value_lists (const object ob1, const object ob2)	160	compare_ob_value_lists (const object ob1, const object ob2)
176	{	161	{
177	/* However, there may be fields in has which aren't partnered in wants,	162	/* However, there may be fields in has which aren't partnered in wants,
178	* so we need to run the comparison twice. :(	163	* so we need to run the comparison twice. :(
179	*/	164	*/
180	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	165	return compare_ob_value_lists_one (ob1, ob2)
		166	&& compare_ob_value_lists_one (ob2, ob1);
181	}	167	}
182		168
183	/* Function examines the 2 objects given to it, and returns true if	169	/* Function examines the 2 objects given to it, and returns true if
184	* they can be merged together.	170	* they can be merged together.
185	*	171	*
…		…
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221		207
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224		210
225	if (ob1->arch->name != ob2->arch->name	211	if (ob1->arch->archname != ob2->arch->archname
226	\|\| ob1->name != ob2->name	212	\|\| ob1->name != ob2->name
227	\|\| ob1->title != ob2->title	213	\|\| ob1->title != ob2->title
228	\|\| ob1->msg != ob2->msg	214	\|\| ob1->msg != ob2->msg
229	\|\| ob1->weight != ob2->weight	215	\|\| ob1->weight != ob2->weight
230	\|\| ob1->attacktype != ob2->attacktype	216	\|\| ob1->attacktype != ob2->attacktype
231	\|\| ob1->magic != ob2->magic	217	\|\| ob1->magic != ob2->magic
232	\|\| ob1->slaying != ob2->slaying	218	\|\| ob1->slaying != ob2->slaying
233	\|\| ob1->skill != ob2->skill	219	\|\| ob1->skill != ob2->skill
234	\|\| ob1->value != ob2->value	220	\|\| ob1->value != ob2->value
235	\|\| ob1->animation_id != ob2->animation_id	221	\|\| ob1->animation_id != ob2->animation_id
		222	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
236	\|\| ob1->client_type != ob2->client_type	223	\|\| ob1->client_type != ob2->client_type
237	\|\| ob1->materialname != ob2->materialname	224	\|\| ob1->materialname != ob2->materialname
238	\|\| ob1->lore != ob2->lore	225	\|\| ob1->lore != ob2->lore
239	\|\| ob1->subtype != ob2->subtype	226	\|\| ob1->subtype != ob2->subtype
240	\|\| ob1->move_type != ob2->move_type	227	\|\| ob1->move_type != ob2->move_type
…		…
334		321
335	// find player who can see this object	322	// find player who can see this object
336	object *	323	object *
337	object::visible_to () const	324	object::visible_to () const
338	{	325	{
339	if (!flag [FLAG_REMOVED])	326	if (client_visible () && !flag [FLAG_REMOVED])
340	{	327	{
341	// see if we are in a container of sorts	328	// see if we are in a container of sorts
342	if (env)	329	if (env)
343	{	330	{
344	// the player inventory itself is always visible	331	// the player inventory itself is always visible
…		…
358	else	345	else
359	{	346	{
360	// maybe there is a player standing on the same mapspace	347	// maybe there is a player standing on the same mapspace
361	// this will catch the case where "this" is a player	348	// this will catch the case where "this" is a player
362	if (object *pl = ms ().player ())	349	if (object *pl = ms ().player ())
		350	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
		351	\|\| this == pl->container)
363	return pl;	352	return pl;
364	}	353	}
365	}	354	}
366		355
367	return 0;	356	return 0;
368	}	357	}
369		358
370	// adjust weight per container type ("of holding")	359	// adjust weight per container type ("of holding")
371	static sint32	360	static sint32
372	weight_adjust (object *op, sint32 weight)	361	weight_adjust_for (object *op, sint32 weight)
373	{	362	{
374	return op->type == CONTAINER	363	return op->type == CONTAINER
375	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	364	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
376	: weight;	365	: weight;
377	}	366	}
…		…
383	static void	372	static void
384	adjust_weight (object *op, sint32 weight)	373	adjust_weight (object *op, sint32 weight)
385	{	374	{
386	while (op)	375	while (op)
387	{	376	{
		377	// adjust by actual difference to account for rounding errors
		378	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
388	weight = weight_adjust (op, weight);	379	weight = weight_adjust_for (op, op->carrying)
		380	- weight_adjust_for (op, op->carrying - weight);
389		381
390	if (!weight)	382	if (!weight)
391	return;	383	return;
392		384
393	op->carrying += weight;	385	op->carrying += weight;
…		…
416	op->update_weight ();	408	op->update_weight ();
417		409
418	sum += op->total_weight ();	410	sum += op->total_weight ();
419	}	411	}
420		412
421	sum = weight_adjust (this, sum);	413	sum = weight_adjust_for (this, sum);
422		414
423	if (sum != carrying)	415	if (sum != carrying)
424	{	416	{
425	carrying = sum;	417	carrying = sum;
426		418
…		…
488	*/	480	*/
489	object *	481	object *
490	find_object_name (const char *str)	482	find_object_name (const char *str)
491	{	483	{
492	shstr_cmp str_ (str);	484	shstr_cmp str_ (str);
493	object *op;
494		485
		486	if (str_)
495	for_all_objects (op)	487	for_all_objects (op)
496	if (op->name == str_)	488	if (op->name == str_)
497	break;	489	return op;
498		490
499	return op;	491	return 0;
500	}	492	}
501		493
502	/*	494	/*
503	* Sets the owner and sets the skill and exp pointers to owner's current	495	* Sets the owner and sets the skill and exp pointers to owner's current
504	* skill and experience objects.	496	* skill and experience objects.
…		…
602	}	594	}
603		595
604	op->key_values = 0;	596	op->key_values = 0;
605	}	597	}
606		598
607	object &	599	/*
608	object::operator =(const object &src)	600	* copy_to first frees everything allocated by the dst object,
		601	* and then copies the contents of itself into the second
		602	* object, allocating what needs to be allocated. Basically, any
		603	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		604	* if the first object is freed, the pointers in the new object
		605	* will point at garbage.
		606	*/
		607	void
		608	object::copy_to (object *dst)
609	{	609	{
610	bool is_freed = flag [FLAG_FREED];	610	dst->remove ();
611	bool is_removed = flag [FLAG_REMOVED];
612
613	(object_copy )this = src;	611	(object_copy )dst = *this;
614
615	flag [FLAG_FREED] = is_freed;
616	flag [FLAG_REMOVED] = is_removed;	612	dst->flag [FLAG_REMOVED] = true;
617		613
618	/* Copy over key_values, if any. */	614	/* Copy over key_values, if any. */
619	if (src.key_values)	615	if (key_values)
620	{	616	{
621	key_value *tail = 0;	617	key_value *tail = 0;
622	key_values = 0;	618	dst->key_values = 0;
623		619
624	for (key_value *i = src.key_values; i; i = i->next)	620	for (key_value *i = key_values; i; i = i->next)
625	{	621	{
626	key_value *new_link = new key_value;	622	key_value *new_link = new key_value;
627		623
628	new_link->next = 0;	624	new_link->next = 0;
629	new_link->key = i->key;	625	new_link->key = i->key;
630	new_link->value = i->value;	626	new_link->value = i->value;
631		627
632	/* Try and be clever here, too. */	628	/* Try and be clever here, too. */
633	if (!key_values)	629	if (!dst->key_values)
634	{	630	{
635	key_values = new_link;	631	dst->key_values = new_link;
636	tail = new_link;	632	tail = new_link;
637	}	633	}
638	else	634	else
639	{	635	{
640	tail->next = new_link;	636	tail->next = new_link;
641	tail = new_link;	637	tail = new_link;
642	}	638	}
643	}	639	}
644	}	640	}
645	}
646
647	/*
648	* copy_to first frees everything allocated by the dst object,
649	* and then copies the contents of itself into the second
650	* object, allocating what needs to be allocated. Basically, any
651	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
652	* if the first object is freed, the pointers in the new object
653	* will point at garbage.
654	*/
655	void
656	object::copy_to (object *dst)
657	{
658	dst = this;
659		641
660	if (speed < 0)	642	if (speed < 0)
661	dst->speed_left -= rndm ();	643	dst->speed_left -= rndm ();
662		644
663	dst->set_speed (dst->speed);	645	dst->set_speed (dst->speed);
…		…
685	object *	667	object *
686	object::clone ()	668	object::clone ()
687	{	669	{
688	object *neu = create ();	670	object *neu = create ();
689	copy_to (neu);	671	copy_to (neu);
		672	neu->map = map; // not copied by copy_to
690	return neu;	673	return neu;
691	}	674	}
692		675
693	/*	676	/*
694	* If an object with the IS_TURNABLE() flag needs to be turned due	677	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
745	* UP_OBJ_FACE: only the objects face has changed.	728	* UP_OBJ_FACE: only the objects face has changed.
746	*/	729	*/
747	void	730	void
748	update_object (object *op, int action)	731	update_object (object *op, int action)
749	{	732	{
750	if (op == NULL)	733	if (!op)
751	{	734	{
752	/* this should never happen */	735	/* this should never happen */
753	LOG (llevDebug, "update_object() called for NULL object.\n");	736	LOG (llevError \| logBacktrace, "update_object() called for NULL object.\n");
754	return;	737	return;
755	}	738	}
756		739
757	if (op->env)	740	if (!op->is_on_map ())
758	{	741	{
759	/* Animation is currently handled by client, so nothing	742	/* Animation is currently handled by client, so nothing
760	* to do in this case.	743	* to do in this case.
761	*/	744	*/
762	return;	745	return;
763	}	746	}
764
765	/* If the map is saving, don't do anything as everything is
766	* going to get freed anyways.
767	*/
768	if (!op->map \|\| op->map->in_memory == MAP_SAVING)
769	return;
770		747
771	/* make sure the object is within map boundaries */	748	/* make sure the object is within map boundaries */
772	if (op->x < 0 \|\| op->x >= op->map->width \|\| op->y < 0 \|\| op->y >= op->map->height)	749	if (op->x < 0 \|\| op->x >= op->map->width \|\| op->y < 0 \|\| op->y >= op->map->height)
773	{	750	{
774	LOG (llevError, "update_object() called for object out of map!\n");	751	LOG (llevError, "update_object() called for object out of map!\n");
…		…
929	* drop on that space.	906	* drop on that space.
930	*/	907	*/
931	if (!drop_to_ground	908	if (!drop_to_ground
932	\|\| !map	909	\|\| !map
933	\|\| map->in_memory != MAP_ACTIVE	910	\|\| map->in_memory != MAP_ACTIVE
934	\|\| map->nodrop	911	\|\| map->no_drop
935	\|\| ms ().move_block == MOVE_ALL)	912	\|\| ms ().move_block == MOVE_ALL)
936	{	913	{
937	while (inv)	914	while (inv)
938	{
939	inv->destroy_inv (false);
940	inv->destroy ();	915	inv->destroy (true);
941	}
942	}	916	}
943	else	917	else
944	{ /* Put objects in inventory onto this space */	918	{ /* Put objects in inventory onto this space */
945	while (inv)	919	while (inv)
946	{	920	{
…		…
964	object *op = new object;	938	object *op = new object;
965	op->link ();	939	op->link ();
966	return op;	940	return op;
967	}	941	}
968		942
		943	static struct freed_map : maptile
		944	{
		945	freed_map ()
		946	{
		947	path = "<freed objects map>";
		948	name = "/internal/freed_objects_map";
		949	width = 3;
		950	height = 3;
		951	no_drop = 1;
		952	no_reset = 1;
		953
		954	alloc ();
		955	in_memory = MAP_ACTIVE;
		956	}
		957
		958	~freed_map ()
		959	{
		960	destroy ();
		961	}
		962	} freed_map; // freed objects are moved here to avoid crashes
		963
969	void	964	void
970	object::do_destroy ()	965	object::do_destroy ()
971	{	966	{
972	if (flag [FLAG_IS_LINKED])	967	if (flag [FLAG_IS_LINKED])
973	remove_button_link (this);	968	remove_button_link (this);
…		…
983	unlink ();	978	unlink ();
984		979
985	flag [FLAG_FREED] = 1;	980	flag [FLAG_FREED] = 1;
986		981
987	// hack to ensure that freed objects still have a valid map	982	// hack to ensure that freed objects still have a valid map
988	{
989	static maptile *freed_map; // freed objects are moved here to avoid crashes
990
991	if (!freed_map)
992	{
993	freed_map = new maptile;
994
995	freed_map->path = "<freed objects map>";
996	freed_map->name = "/internal/freed_objects_map";
997	freed_map->width = 3;
998	freed_map->height = 3;
999	freed_map->nodrop = 1;
1000
1001	freed_map->alloc ();
1002	freed_map->in_memory = MAP_ACTIVE;
1003	}
1004
1005	map = freed_map;	983	map = &freed_map;
1006	x = 1;	984	x = 1;
1007	y = 1;	985	y = 1;
1008	}
1009		986
1010	if (more)	987	if (more)
1011	{	988	{
1012	more->destroy ();	989	more->destroy ();
1013	more = 0;	990	more = 0;
…		…
1030		1007
1031	if (!is_head () && !head->destroyed ())	1008	if (!is_head () && !head->destroyed ())
1032	{	1009	{
1033	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1010	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1034	head->destroy (destroy_inventory);	1011	head->destroy (destroy_inventory);
		1012	return;
1035	}	1013	}
1036		1014
1037	destroy_inv (!destroy_inventory);	1015	destroy_inv (!destroy_inventory);
1038		1016
1039	if (is_head ())	1017	if (is_head ())
…		…
1061	if (flag [FLAG_REMOVED])	1039	if (flag [FLAG_REMOVED])
1062	return;	1040	return;
1063		1041
1064	INVOKE_OBJECT (REMOVE, this);	1042	INVOKE_OBJECT (REMOVE, this);
1065		1043
1066	if (object *pl = visible_to ())
1067	esrv_del_item (pl->contr, count);
1068
1069	flag [FLAG_REMOVED] = true;	1044	flag [FLAG_REMOVED] = true;
1070		1045
1071	if (more)	1046	if (more)
1072	more->remove ();	1047	more->remove ();
1073		1048
…		…
1075	* In this case, the object to be removed is in someones	1050	* In this case, the object to be removed is in someones
1076	* inventory.	1051	* inventory.
1077	*/	1052	*/
1078	if (env)	1053	if (env)
1079	{	1054	{
		1055	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1056	if (object *pl = visible_to ())
		1057	esrv_del_item (pl->contr, count);
		1058	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1059
1080	adjust_weight (env, -total_weight ());	1060	adjust_weight (env, -total_weight ());
1081
1082	*(above ? &above->below : &env->inv) = below;
1083
1084	if (below)
1085	below->above = above;
1086		1061
1087	/* we set up values so that it could be inserted into	1062	/* we set up values so that it could be inserted into
1088	* the map, but we don't actually do that - it is up	1063	* the map, but we don't actually do that - it is up
1089	* to the caller to decide what we want to do.	1064	* to the caller to decide what we want to do.
1090	*/	1065	*/
1091	map = env->map;	1066	map = env->map;
1092	x = env->x;	1067	x = env->x;
1093	y = env->y;	1068	y = env->y;
		1069
		1070	// make sure cmov optimisation is applicable
		1071	*(above ? &above->below : &env->inv) = below;
		1072	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1073
1094	above = 0;	1074	above = 0;
1095	below = 0;	1075	below = 0;
1096	env = 0;	1076	env = 0;
1097		1077
1098	/* NO_FIX_PLAYER is set when a great many changes are being	1078	/* NO_FIX_PLAYER is set when a great many changes are being
…		…
1102	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1082	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1103	otmp->update_stats ();	1083	otmp->update_stats ();
1104	}	1084	}
1105	else if (map)	1085	else if (map)
1106	{	1086	{
1107	if (type == PLAYER)
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
1119	map->dirty = true;	1087	map->dirty = true;
1120	mapspace &ms = this->ms ();	1088	mapspace &ms = this->ms ();
1121		1089
		1090	if (object *pl = ms.player ())
		1091	{
		1092	if (type == PLAYER) // this == pl(!)
		1093	{
		1094	// leaving a spot always closes any open container on the ground
		1095	if (container && !container->env)
		1096	// this causes spurious floorbox updates, but it ensures
		1097	// that the CLOSE event is being sent.
		1098	close_container ();
		1099
		1100	--map->players;
		1101	map->touch ();
		1102	}
		1103	else if (pl->container == this)
		1104	{
		1105	// removing a container should close it
		1106	close_container ();
		1107	}
		1108
		1109	esrv_del_item (pl->contr, count);
		1110	}
		1111
1122	/* link the object above us */	1112	/* link the object above us */
1123	if (above)	1113	// re-link, make sure compiler can easily use cmove
1124	above->below = below;	1114	*(above ? &above->below : &ms.top) = below;
1125	else	1115	*(below ? &below->above : &ms.bot) = above;
1126	ms.top = below; /* we were top, set new top */
1127
1128	/* Relink the object below us, if there is one */
1129	if (below)
1130	below->above = above;
1131	else
1132	{
1133	/* Nothing below, which means we need to relink map object for this space
1134	* use translated coordinates in case some oddness with map tiling is
1135	* evident
1136	*/
1137	if (GET_MAP_OB (map, x, y) != this)
1138	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1139
1140	ms.bot = above; /* goes on above it. */
1141	}
1142		1116
1143	above = 0;	1117	above = 0;
1144	below = 0;	1118	below = 0;
1145		1119
1146	if (map->in_memory == MAP_SAVING)	1120	if (map->in_memory == MAP_SAVING)
…		…
1156	* appropriately.	1130	* appropriately.
1157	*/	1131	*/
1158	pl->close_container ();	1132	pl->close_container ();
1159		1133
1160	//TODO: the floorbox prev/next might need updating	1134	//TODO: the floorbox prev/next might need updating
1161	esrv_del_item (pl->contr, count);	1135	//esrv_del_item (pl->contr, count);
		1136	//TODO: update floorbox to preserve ordering
		1137	if (pl->contr->ns)
		1138	pl->contr->ns->floorbox_update ();
1162	}	1139	}
1163		1140
1164	for (tmp = ms.bot; tmp; tmp = tmp->above)	1141	for (tmp = ms.bot; tmp; tmp = tmp->above)
1165	{	1142	{
1166	/* No point updating the players look faces if he is the object	1143	/* No point updating the players look faces if he is the object
…		…
1258	* job preparing multi-part monsters.	1235	* job preparing multi-part monsters.
1259	*/	1236	*/
1260	object *	1237	object *
1261	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1238	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1262	{	1239	{
		1240	op->remove ();
		1241
1263	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1242	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1264	{	1243	{
1265	tmp->x = x + tmp->arch->x;	1244	tmp->x = x + tmp->arch->x;
1266	tmp->y = y + tmp->arch->y;	1245	tmp->y = y + tmp->arch->y;
1267	}	1246	}
…		…
1290	* just 'op' otherwise	1269	* just 'op' otherwise
1291	*/	1270	*/
1292	object *	1271	object *
1293	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1272	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1294	{	1273	{
1295	assert (!op->flag [FLAG_FREED]);	1274	if (op->is_on_map ())
		1275	{
		1276	LOG (llevError, "insert_ob_in_map called for object already on map");
		1277	abort ();
		1278	}
1296		1279
		1280	if (op->env)
		1281	{
		1282	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1297	op->remove ();	1283	op->remove ();
		1284	}
		1285
		1286	if (op->face && !face_info (op->face))//D TODO: remove soon
		1287	{//D
		1288	LOG (llevError \| logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D
		1289	op->face = 1;//D
		1290	}//D
1298		1291
1299	/* Ideally, the caller figures this out. However, it complicates a lot	1292	/* Ideally, the caller figures this out. However, it complicates a lot
1300	* of areas of callers (eg, anything that uses find_free_spot would now	1293	* of areas of callers (eg, anything that uses find_free_spot would now
1301	* need extra work	1294	* need extra work
1302	*/	1295	*/
1303	if (!xy_normalise (m, op->x, op->y))	1296	if (!xy_normalise (m, op->x, op->y))
1304	{	1297	{
1305	op->destroy (1);	1298	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1306	return 0;	1299	return 0;
1307	}	1300	}
1308		1301
1309	if (object *more = op->more)	1302	if (object *more = op->more)
1310	if (!insert_ob_in_map (more, m, originator, flag))	1303	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1319	*/	1312	*/
1320	if (op->nrof && !(flag & INS_NO_MERGE))	1313	if (op->nrof && !(flag & INS_NO_MERGE))
1321	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1314	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1322	if (object::can_merge (op, tmp))	1315	if (object::can_merge (op, tmp))
1323	{	1316	{
1324	// TODO: we atcually want to update tmp, not op,	1317	// TODO: we actually want to update tmp, not op,
1325	// but some caller surely breaks when we return tmp	1318	// but some caller surely breaks when we return tmp
1326	// from here :/	1319	// from here :/
1327	op->nrof += tmp->nrof;	1320	op->nrof += tmp->nrof;
1328	tmp->destroy (1);	1321	tmp->destroy (1);
1329	}	1322	}
…		…
1340	{	1333	{
1341	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1334	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1342	abort ();	1335	abort ();
1343	}	1336	}
1344		1337
		1338	if (!originator->is_on_map ())
		1339	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1340	op->debug_desc (), originator->debug_desc ());
		1341
1345	op->above = originator;	1342	op->above = originator;
1346	op->below = originator->below;	1343	op->below = originator->below;
1347
1348	if (op->below)
1349	op->below->above = op;
1350	else
1351	ms.bot = op;
1352
1353	/* since below originator, no need to update top */
1354	originator->below = op;	1344	originator->below = op;
		1345
		1346	*(op->below ? &op->below->above : &ms.bot) = op;
1355	}	1347	}
1356	else	1348	else
1357	{	1349	{
1358	object top, floor = NULL;	1350	object *floor = 0;
1359		1351	object *top = ms.top;
1360	top = ms.bot;
1361		1352
1362	/* If there are other objects, then */	1353	/* If there are other objects, then */
1363	if (top)	1354	if (top)
1364	{	1355	{
1365	object *last = 0;
1366
1367	/*	1356	/*
1368	* If there are multiple objects on this space, we do some trickier handling.	1357	* If there are multiple objects on this space, we do some trickier handling.
1369	* We've already dealt with merging if appropriate.	1358	* We've already dealt with merging if appropriate.
1370	* Generally, we want to put the new object on top. But if	1359	* Generally, we want to put the new object on top. But if
1371	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1360	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1374	* once we get to them. This reduces the need to traverse over all of	1363	* once we get to them. This reduces the need to traverse over all of
1375	* them when adding another one - this saves quite a bit of cpu time	1364	* them when adding another one - this saves quite a bit of cpu time
1376	* when lots of spells are cast in one area. Currently, it is presumed	1365	* when lots of spells are cast in one area. Currently, it is presumed
1377	* that flying non pickable objects are spell objects.	1366	* that flying non pickable objects are spell objects.
1378	*/	1367	*/
1379	for (top = ms.bot; top; top = top->above)	1368	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1380	{	1369	{
1381	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1370	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) \|\| QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1382	floor = top;	1371	floor = tmp;
1383		1372
1384	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1373	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1385	{	1374	{
1386	/* We insert above top, so we want this object below this */	1375	/* We insert above top, so we want this object below this */
1387	top = top->below;	1376	top = tmp->below;
1388	break;	1377	break;
1389	}	1378	}
1390		1379
1391	last = top;	1380	top = tmp;
1392	}	1381	}
1393
1394	/* Don't want top to be NULL, so set it to the last valid object */
1395	top = last;
1396		1382
1397	/* We let update_position deal with figuring out what the space	1383	/* We let update_position deal with figuring out what the space
1398	* looks like instead of lots of conditions here.	1384	* looks like instead of lots of conditions here.
1399	* makes things faster, and effectively the same result.	1385	* makes things faster, and effectively the same result.
1400	*/	1386	*/
…		…
1407	*/	1393	*/
1408	if (!(flag & INS_ON_TOP)	1394	if (!(flag & INS_ON_TOP)
1409	&& ms.flags () & P_BLOCKSVIEW	1395	&& ms.flags () & P_BLOCKSVIEW
1410	&& (op->face && !faces [op->face].visibility))	1396	&& (op->face && !faces [op->face].visibility))
1411	{	1397	{
		1398	object *last;
		1399
1412	for (last = top; last != floor; last = last->below)	1400	for (last = top; last != floor; last = last->below)
1413	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1401	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1414	break;	1402	break;
1415		1403
1416	/* Check to see if we found the object that blocks view,	1404	/* Check to see if we found the object that blocks view,
…		…
1424	} /* If objects on this space */	1412	} /* If objects on this space */
1425		1413
1426	if (flag & INS_ABOVE_FLOOR_ONLY)	1414	if (flag & INS_ABOVE_FLOOR_ONLY)
1427	top = floor;	1415	top = floor;
1428		1416
1429	/* Top is the object that our object (op) is going to get inserted above.	1417	// insert object above top, or bottom-most if top = 0
1430	*/
1431
1432	/* First object on this space */
1433	if (!top)	1418	if (!top)
1434	{	1419	{
		1420	op->below = 0;
1435	op->above = ms.bot;	1421	op->above = ms.bot;
1436
1437	if (op->above)
1438	op->above->below = op;
1439
1440	op->below = 0;
1441	ms.bot = op;	1422	ms.bot = op;
		1423
		1424	*(op->above ? &op->above->below : &ms.top) = op;
1442	}	1425	}
1443	else	1426	else
1444	{ /* get inserted into the stack above top */	1427	{
1445	op->above = top->above;	1428	op->above = top->above;
1446
1447	if (op->above)
1448	op->above->below = op;	1429	top->above = op;
1449		1430
1450	op->below = top;	1431	op->below = top;
1451	top->above = op;	1432	*(op->above ? &op->above->below : &ms.top) = op;
1452	}	1433	}
1453		1434	}
1454	if (!op->above)
1455	ms.top = op;
1456	} /* else not INS_BELOW_ORIGINATOR */
1457		1435
1458	if (op->type == PLAYER)	1436	if (op->type == PLAYER)
1459	{	1437	{
1460	op->contr->do_los = 1;	1438	op->contr->do_los = 1;
1461	++op->map->players;	1439	++op->map->players;
…		…
1464		1442
1465	op->map->dirty = true;	1443	op->map->dirty = true;
1466		1444
1467	if (object *pl = ms.player ())	1445	if (object *pl = ms.player ())
1468	//TODO: the floorbox prev/next might need updating	1446	//TODO: the floorbox prev/next might need updating
1469	esrv_send_item (pl, op);	1447	//esrv_send_item (pl, op);
		1448	//TODO: update floorbox to preserve ordering
		1449	if (pl->contr->ns)
		1450	pl->contr->ns->floorbox_update ();
1470		1451
1471	/* If this object glows, it may affect lighting conditions that are	1452	/* If this object glows, it may affect lighting conditions that are
1472	* visible to others on this map. But update_all_los is really	1453	* visible to others on this map. But update_all_los is really
1473	* an inefficient way to do this, as it means los for all players	1454	* an inefficient way to do this, as it means los for all players
1474	* on the map will get recalculated. The players could very well	1455	* on the map will get recalculated. The players could very well
…		…
1554	if (!nr)	1535	if (!nr)
1555	return true;	1536	return true;
1556		1537
1557	nr = min (nr, nrof);	1538	nr = min (nr, nrof);
1558		1539
		1540	if (nrof > nr)
		1541	{
1559	nrof -= nr;	1542	nrof -= nr;
1560
1561	if (nrof)
1562	{
1563	adjust_weight (env, -weight * nr); // carrying == 0	1543	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1564		1544
1565	if (object *pl = visible_to ())	1545	if (object *pl = visible_to ())
1566	esrv_update_item (UPD_NROF, pl, this);	1546	esrv_update_item (UPD_NROF, pl, this);
1567		1547
1568	return true;	1548	return true;
1569	}	1549	}
1570	else	1550	else
1571	{	1551	{
1572	destroy (1);	1552	destroy ();
1573	return false;	1553	return false;
1574	}	1554	}
1575	}	1555	}
1576		1556
1577	/*	1557	/*
…		…
1594	}	1574	}
1595	else	1575	else
1596	{	1576	{
1597	decrease (nr);	1577	decrease (nr);
1598		1578
1599	object *op = object_create_clone (this);	1579	object *op = deep_clone ();
1600	op->nrof = nr;	1580	op->nrof = nr;
1601	return op;	1581	return op;
1602	}	1582	}
1603	}	1583	}
1604		1584
…		…
1825	LOG (llevError, "Present_arch called outside map.\n");	1805	LOG (llevError, "Present_arch called outside map.\n");
1826	return NULL;	1806	return NULL;
1827	}	1807	}
1828		1808
1829	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1809	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1830	if (tmp->arch == at)	1810	if (tmp->arch->archname == at->archname)
1831	return tmp;	1811	return tmp;
1832		1812
1833	return NULL;	1813	return NULL;
1834	}	1814	}
1835		1815
…		…
1899	* The first matching object is returned, or NULL if none.	1879	* The first matching object is returned, or NULL if none.
1900	*/	1880	*/
1901	object *	1881	object *
1902	present_arch_in_ob (const archetype at, const object op)	1882	present_arch_in_ob (const archetype at, const object op)
1903	{	1883	{
1904	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1884	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1905	if (tmp->arch == at)	1885	if (tmp->arch->archname == at->archname)
1906	return tmp;	1886	return tmp;
1907		1887
1908	return NULL;	1888	return NULL;
1909	}	1889	}
1910		1890
…		…
2319		2299
2320	/*	2300	/*
2321	* create clone from object to another	2301	* create clone from object to another
2322	*/	2302	*/
2323	object *	2303	object *
2324	object_create_clone (object *asrc)	2304	object::deep_clone ()
2325	{	2305	{
2326	object dst = 0, tmp, src, prev, *item;	2306	assert (("deep_clone called on non-head object", is_head ()));
2327		2307
2328	if (!asrc)	2308	object *dst = clone ();
2329	return 0;
2330		2309
2331	src = asrc->head_ ();	2310	object *prev = dst;
2332
2333	prev = 0;
2334	for (object *part = src; part; part = part->more)	2311	for (object *part = this->more; part; part = part->more)
2335	{	2312	{
2336	tmp = part->clone ();	2313	object *tmp = part->clone ();
2337	tmp->x -= src->x;
2338	tmp->y -= src->y;
2339
2340	if (!part->head)
2341	{
2342	dst = tmp;
2343	tmp->head = 0;
2344	}
2345	else
2346	tmp->head = dst;	2314	tmp->head = dst;
2347
2348	tmp->more = 0;
2349
2350	if (prev)
2351	prev->more = tmp;	2315	prev->more = tmp;
2352
2353	prev = tmp;	2316	prev = tmp;
2354	}	2317	}
2355		2318
2356	for (item = src->inv; item; item = item->below)	2319	for (object *item = inv; item; item = item->below)
2357	insert_ob_in_ob (object_create_clone (item), dst);	2320	insert_ob_in_ob (item->deep_clone (), dst);
2358		2321
2359	return dst;	2322	return dst;
2360	}	2323	}
2361		2324
2362	/* This returns the first object in who's inventory that	2325	/* This returns the first object in who's inventory that
…		…
2371	return tmp;	2334	return tmp;
2372		2335
2373	return 0;	2336	return 0;
2374	}	2337	}
2375		2338
2376	/* If ob has a field named key, return the link from the list,	2339	const shstr &
2377	* otherwise return NULL.	2340	object::kv_get (const shstr &key) const
2378	*
2379	* key must be a passed in shared string - otherwise, this won't
2380	* do the desired thing.
2381	*/
2382	key_value *
2383	get_ob_key_link (const object ob, const char key)
2384	{	2341	{
2385	for (key_value *link = ob->key_values; link; link = link->next)	2342	for (key_value *kv = key_values; kv; kv = kv->next)
2386	if (link->key == key)	2343	if (kv->key == key)
2387	return link;
2388
2389	return 0;
2390	}
2391
2392	/*
2393	* Returns the value of op has an extra_field for key, or NULL.
2394	*
2395	* The argument doesn't need to be a shared string.
2396	*
2397	* The returned string is shared.
2398	*/
2399	const char *
2400	get_ob_key_value (const object op, const char const key)
2401	{
2402	key_value *link;
2403	shstr_cmp canonical_key (key);
2404
2405	if (!canonical_key)
2406	{
2407	/* 1. There being a field named key on any object
2408	* implies there'd be a shared string to find.
2409	* 2. Since there isn't, no object has this field.
2410	* 3. Therefore, this object doesn't have this field.
2411	*/
2412	return 0;
2413	}
2414
2415	/* This is copied from get_ob_key_link() above -
2416	* only 4 lines, and saves the function call overhead.
2417	*/
2418	for (link = op->key_values; link; link = link->next)
2419	if (link->key == canonical_key)
2420	return link->value;	2344	return kv->value;
2421		2345
2422	return 0;	2346	return shstr_null;
2423	}	2347	}
2424		2348
2425	/*	2349	void
2426	* Updates the canonical_key in op to value.	2350	object::kv_set (const shstr &key, const shstr &value)
2427	*
2428	* canonical_key is a shared string (value doesn't have to be).
2429	*
2430	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2431	* keys.
2432	*
2433	* Returns TRUE on success.
2434	*/
2435	int
2436	set_ob_key_value_s (object op, const shstr & canonical_key, const char value, int add_key)
2437	{	2351	{
2438	key_value field = NULL, last = NULL;	2352	for (key_value *kv = key_values; kv; kv = kv->next)
2439		2353	if (kv->key == key)
2440	for (field = op->key_values; field != NULL; field = field->next)
2441	{
2442	if (field->key != canonical_key)
2443	{	2354	{
2444	last = field;	2355	kv->value = value;
2445	continue;	2356	return;
2446	}	2357	}
2447		2358
2448	if (value)	2359	key_value *kv = new key_value;
2449	field->value = value;	2360
2450	else	2361	kv->next = key_values;
		2362	kv->key = key;
		2363	kv->value = value;
		2364
		2365	key_values = kv;
		2366	}
		2367
		2368	void
		2369	object::kv_del (const shstr &key)
		2370	{
		2371	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
		2372	if ((*kvp)->key == key)
2451	{	2373	{
2452	/* Basically, if the archetype has this key set,	2374	key_value kv = kvp;
2453	* we need to store the null value so when we save	2375	kvp = (kvp)->next;
2454	* it, we save the empty value so that when we load,	2376	delete kv;
2455	* we get this value back again.	2377	return;
2456	*/
2457	if (get_ob_key_link (op->arch, canonical_key))
2458	field->value = 0;
2459	else
2460	{
2461	if (last)
2462	last->next = field->next;
2463	else
2464	op->key_values = field->next;
2465
2466	delete field;
2467	}
2468	}	2378	}
2469	return TRUE;
2470	}
2471	/* IF we get here, key doesn't exist */
2472
2473	/* No field, we'll have to add it. */
2474
2475	if (!add_key)
2476	return FALSE;
2477
2478	/* There isn't any good reason to store a null
2479	* value in the key/value list. If the archetype has
2480	* this key, then we should also have it, so shouldn't
2481	* be here. If user wants to store empty strings,
2482	* should pass in ""
2483	*/
2484	if (value == NULL)
2485	return TRUE;
2486
2487	field = new key_value;
2488
2489	field->key = canonical_key;
2490	field->value = value;
2491	/* Usual prepend-addition. */
2492	field->next = op->key_values;
2493	op->key_values = field;
2494
2495	return TRUE;
2496	}
2497
2498	/*
2499	* Updates the key in op to value.
2500	*
2501	* If add_key is FALSE, this will only update existing keys,
2502	* and not add new ones.
2503	* In general, should be little reason FALSE is ever passed in for add_key
2504	*
2505	* Returns TRUE on success.
2506	*/
2507	int
2508	set_ob_key_value (object op, const char key, const char *value, int add_key)
2509	{
2510	shstr key_ (key);
2511
2512	return set_ob_key_value_s (op, key_, value, add_key);
2513	}	2379	}
2514		2380
2515	object::depth_iterator::depth_iterator (object *container)	2381	object::depth_iterator::depth_iterator (object *container)
2516	: iterator_base (container)	2382	: iterator_base (container)
2517	{	2383	{
…		…
2567	{	2433	{
2568	char flagdesc[512];	2434	char flagdesc[512];
2569	char info2[256 * 4];	2435	char info2[256 * 4];
2570	char *p = info;	2436	char *p = info;
2571		2437
2572	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2438	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2573	count,	2439	count,
2574	uuid.c_str (),	2440	uuid.c_str (),
2575	&name,	2441	&name,
2576	title ? "\",title:\"" : "",	2442	title ? ",title:\"" : "",
2577	title ? (const char *)title : "",	2443	title ? (const char *)title : "",
		2444	title ? "\"" : "",
2578	flag_desc (flagdesc, 512), type);	2445	flag_desc (flagdesc, 512), type);
2579		2446
2580	if (!flag[FLAG_REMOVED] && env)	2447	if (!flag[FLAG_REMOVED] && env)
2581	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2448	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2582		2449
…		…
2615	object::open_container (object *new_container)	2482	object::open_container (object *new_container)
2616	{	2483	{
2617	if (container == new_container)	2484	if (container == new_container)
2618	return;	2485	return;
2619		2486
2620	if (object *old_container = container)	2487	object *old_container = container;
		2488
		2489	if (old_container)
2621	{	2490	{
2622	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2491	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2623	return;	2492	return;
2624		2493
2625	#if 0	2494	#if 0
…		…
2627	if (object *closer = old_container->inv)	2496	if (object *closer = old_container->inv)
2628	if (closer->type == CLOSE_CON)	2497	if (closer->type == CLOSE_CON)
2629	closer->destroy ();	2498	closer->destroy ();
2630	#endif	2499	#endif
2631		2500
		2501	// make sure the container is available
		2502	esrv_send_item (this, old_container);
		2503
2632	old_container->flag [FLAG_APPLIED] = false;	2504	old_container->flag [FLAG_APPLIED] = false;
2633	container = 0;	2505	container = 0;
2634		2506
		2507	// client needs item update to make it work, client bug requires this to be separate
2635	esrv_update_item (UPD_FLAGS, this, old_container);	2508	esrv_update_item (UPD_FLAGS, this, old_container);
		2509
2636	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2510	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2637	play_sound (sound_find ("chest_close"));	2511	play_sound (sound_find ("chest_close"));
2638	}	2512	}
2639		2513
2640	if (new_container)	2514	if (new_container)
…		…
2653	}	2527	}
2654	#endif	2528	#endif
2655		2529
2656	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2530	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2657		2531
		2532	// make sure the container is available, client bug requires this to be separate
		2533	esrv_send_item (this, new_container);
		2534
2658	new_container->flag [FLAG_APPLIED] = true;	2535	new_container->flag [FLAG_APPLIED] = true;
2659	container = new_container;	2536	container = new_container;
2660		2537
		2538	// client needs flag change
2661	esrv_update_item (UPD_FLAGS, this, new_container);	2539	esrv_update_item (UPD_FLAGS, this, new_container);
2662	esrv_send_inventory (this, new_container);	2540	esrv_send_inventory (this, new_container);
2663	play_sound (sound_find ("chest_open"));	2541	play_sound (sound_find ("chest_open"));
2664	}	2542	}
		2543	// else if (!old_container->env && contr && contr->ns)
		2544	// contr->ns->floorbox_reset ();
2665	}	2545	}
2666		2546
2667	object *	2547	object *
2668	object::force_find (const shstr name)	2548	object::force_find (const shstr name)
2669	{	2549	{

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.219 by root, Wed Apr 23 21:09:10 2008 UTC vs. Revision 1.251 by root, Sun Jul 20 16:56:34 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.219 by root, Wed Apr 23 21:09:10 2008 UTC vs.
Revision 1.251 by root, Sun Jul 20 16:56:34 2008 UTC