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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.223 by root, Wed Apr 30 08:29:31 2008 UTC vs.
Revision 1.243 by root, Sat May 17 00:17:02 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	*
…		…
200	\|\| ob1->speed != ob2->speed	186	\|\| ob1->speed != ob2->speed
201	\|\| ob1->value != ob2->value	187	\|\| ob1->value != ob2->value
202	\|\| ob1->name != ob2->name)	188	\|\| ob1->name != ob2->name)
203	return 0;	189	return 0;
204		190
		191	// some objects are unmergable
		192	if (!ob1->nrof \|\| !ob2->nrof)
		193	return 0;
		194
205	/* Do not merge objects if nrof would overflow. First part checks	195	/* Do not merge objects if nrof would overflow. First part checks
206	* for unsigned overflow (2c), second part checks whether the result	196	* for unsigned overflow (2c), second part checks whether the result
207	* would fit into a 32 bit signed int, which is often used to hold	197	* would fit into a 32 bit signed int, which is often used to hold
208	* nrof values.	198	* nrof values.
209	*/	199	*/
…		…
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	210	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221		211
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	212	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	213	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224		214
225	if (ob1->arch->name != ob2->arch->name	215	if (ob1->arch->archname != ob2->arch->archname
226	\|\| ob1->name != ob2->name	216	\|\| ob1->name != ob2->name
227	\|\| ob1->title != ob2->title	217	\|\| ob1->title != ob2->title
228	\|\| ob1->msg != ob2->msg	218	\|\| ob1->msg != ob2->msg
229	\|\| ob1->weight != ob2->weight	219	\|\| ob1->weight != ob2->weight
230	\|\| ob1->attacktype != ob2->attacktype	220	\|\| ob1->attacktype != ob2->attacktype
231	\|\| ob1->magic != ob2->magic	221	\|\| ob1->magic != ob2->magic
232	\|\| ob1->slaying != ob2->slaying	222	\|\| ob1->slaying != ob2->slaying
233	\|\| ob1->skill != ob2->skill	223	\|\| ob1->skill != ob2->skill
234	\|\| ob1->value != ob2->value	224	\|\| ob1->value != ob2->value
235	\|\| ob1->animation_id != ob2->animation_id	225	\|\| ob1->animation_id != ob2->animation_id
		226	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
236	\|\| ob1->client_type != ob2->client_type	227	\|\| ob1->client_type != ob2->client_type
237	\|\| ob1->materialname != ob2->materialname	228	\|\| ob1->materialname != ob2->materialname
238	\|\| ob1->lore != ob2->lore	229	\|\| ob1->lore != ob2->lore
239	\|\| ob1->subtype != ob2->subtype	230	\|\| ob1->subtype != ob2->subtype
240	\|\| ob1->move_type != ob2->move_type	231	\|\| ob1->move_type != ob2->move_type
…		…
368	return 0;	359	return 0;
369	}	360	}
370		361
371	// adjust weight per container type ("of holding")	362	// adjust weight per container type ("of holding")
372	static sint32	363	static sint32
373	weight_adjust (object *op, sint32 weight)	364	weight_adjust_for (object *op, sint32 weight)
374	{	365	{
375	return op->type == CONTAINER	366	return op->type == CONTAINER
376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	367	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
377	: weight;	368	: weight;
378	}	369	}
…		…
384	static void	375	static void
385	adjust_weight (object *op, sint32 weight)	376	adjust_weight (object *op, sint32 weight)
386	{	377	{
387	while (op)	378	while (op)
388	{	379	{
		380	// adjust by actual difference to account for rounding errors
		381	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
389	weight = weight_adjust (op, weight);	382	weight = weight_adjust_for (op, op->carrying)
		383	- weight_adjust_for (op, op->carrying - weight);
390		384
391	if (!weight)	385	if (!weight)
392	return;	386	return;
393		387
394	op->carrying += weight;	388	op->carrying += weight;
…		…
417	op->update_weight ();	411	op->update_weight ();
418		412
419	sum += op->total_weight ();	413	sum += op->total_weight ();
420	}	414	}
421		415
422	sum = weight_adjust (this, sum);	416	sum = weight_adjust_for (this, sum);
423		417
424	if (sum != carrying)	418	if (sum != carrying)
425	{	419	{
426	carrying = sum;	420	carrying = sum;
427		421
…		…
489	*/	483	*/
490	object *	484	object *
491	find_object_name (const char *str)	485	find_object_name (const char *str)
492	{	486	{
493	shstr_cmp str_ (str);	487	shstr_cmp str_ (str);
494	object *op;
495		488
		489	if (str_)
496	for_all_objects (op)	490	for_all_objects (op)
497	if (op->name == str_)	491	if (op->name == str_)
498	break;	492	return op;
499		493
500	return op;	494	return 0;
501	}	495	}
502		496
503	/*	497	/*
504	* Sets the owner and sets the skill and exp pointers to owner's current	498	* Sets the owner and sets the skill and exp pointers to owner's current
505	* skill and experience objects.	499	* skill and experience objects.
…		…
603	}	597	}
604		598
605	op->key_values = 0;	599	op->key_values = 0;
606	}	600	}
607		601
608	object &	602	/*
609	object::operator =(const object &src)	603	* copy_to first frees everything allocated by the dst object,
		604	* and then copies the contents of itself into the second
		605	* object, allocating what needs to be allocated. Basically, any
		606	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		607	* if the first object is freed, the pointers in the new object
		608	* will point at garbage.
		609	*/
		610	void
		611	object::copy_to (object *dst)
610	{	612	{
611	bool is_freed = flag [FLAG_FREED];	613	dst->remove ();
612	bool is_removed = flag [FLAG_REMOVED];
613
614	(object_copy )this = src;	614	(object_copy )dst = *this;
615
616	flag [FLAG_FREED] = is_freed;
617	flag [FLAG_REMOVED] = is_removed;	615	dst->flag [FLAG_REMOVED] = true;
618		616
619	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
620	if (src.key_values)	618	if (key_values)
621	{	619	{
622	key_value *tail = 0;	620	key_value *tail = 0;
623	key_values = 0;	621	dst->key_values = 0;
624		622
625	for (key_value *i = src.key_values; i; i = i->next)	623	for (key_value *i = key_values; i; i = i->next)
626	{	624	{
627	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
628		626
629	new_link->next = 0;	627	new_link->next = 0;
630	new_link->key = i->key;	628	new_link->key = i->key;
631	new_link->value = i->value;	629	new_link->value = i->value;
632		630
633	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
634	if (!key_values)	632	if (!dst->key_values)
635	{	633	{
636	key_values = new_link;	634	dst->key_values = new_link;
637	tail = new_link;	635	tail = new_link;
638	}	636	}
639	else	637	else
640	{	638	{
641	tail->next = new_link;	639	tail->next = new_link;
642	tail = new_link;	640	tail = new_link;
643	}	641	}
644	}	642	}
645	}	643	}
646	}
647
648	/*
649	* copy_to first frees everything allocated by the dst object,
650	* and then copies the contents of itself into the second
651	* object, allocating what needs to be allocated. Basically, any
652	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
653	* if the first object is freed, the pointers in the new object
654	* will point at garbage.
655	*/
656	void
657	object::copy_to (object *dst)
658	{
659	dst = this;
660		644
661	if (speed < 0)	645	if (speed < 0)
662	dst->speed_left -= rndm ();	646	dst->speed_left -= rndm ();
663		647
664	dst->set_speed (dst->speed);	648	dst->set_speed (dst->speed);
…		…
686	object *	670	object *
687	object::clone ()	671	object::clone ()
688	{	672	{
689	object *neu = create ();	673	object *neu = create ();
690	copy_to (neu);	674	copy_to (neu);
		675	neu->map = map; // not copied by copy_to
691	return neu;	676	return neu;
692	}	677	}
693		678
694	/*	679	/*
695	* If an object with the IS_TURNABLE() flag needs to be turned due	680	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
924	* drop on that space.	909	* drop on that space.
925	*/	910	*/
926	if (!drop_to_ground	911	if (!drop_to_ground
927	\|\| !map	912	\|\| !map
928	\|\| map->in_memory != MAP_ACTIVE	913	\|\| map->in_memory != MAP_ACTIVE
929	\|\| map->nodrop	914	\|\| map->no_drop
930	\|\| ms ().move_block == MOVE_ALL)	915	\|\| ms ().move_block == MOVE_ALL)
931	{	916	{
932	while (inv)	917	while (inv)
933	{	918	{
934	inv->destroy_inv (false);	919	inv->destroy_inv (false);
…		…
963		948
964	static struct freed_map : maptile	949	static struct freed_map : maptile
965	{	950	{
966	freed_map ()	951	freed_map ()
967	{	952	{
968	path = "<freed objects map>";	953	path = "<freed objects map>";
969	name = "/internal/freed_objects_map";	954	name = "/internal/freed_objects_map";
970	width = 3;	955	width = 3;
971	height = 3;	956	height = 3;
972	nodrop = 1;	957	no_drop = 1;
		958	no_reset = 1;
973		959
974	alloc ();	960	alloc ();
975	in_memory = MAP_ACTIVE;	961	in_memory = MAP_ACTIVE;
		962	}
		963
		964	~freed_map ()
		965	{
		966	destroy ();
976	}	967	}
977	} freed_map; // freed objects are moved here to avoid crashes	968	} freed_map; // freed objects are moved here to avoid crashes
978		969
979	void	970	void
980	object::do_destroy ()	971	object::do_destroy ()
…		…
1071	if (object *pl = visible_to ())	1062	if (object *pl = visible_to ())
1072	esrv_del_item (pl->contr, count);	1063	esrv_del_item (pl->contr, count);
1073	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1064	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1074		1065
1075	adjust_weight (env, -total_weight ());	1066	adjust_weight (env, -total_weight ());
1076
1077	*(above ? &above->below : &env->inv) = below;
1078
1079	if (below)
1080	below->above = above;
1081		1067
1082	/* we set up values so that it could be inserted into	1068	/* we set up values so that it could be inserted into
1083	* the map, but we don't actually do that - it is up	1069	* the map, but we don't actually do that - it is up
1084	* to the caller to decide what we want to do.	1070	* to the caller to decide what we want to do.
1085	*/	1071	*/
1086	map = env->map;	1072	map = env->map;
1087	x = env->x;	1073	x = env->x;
1088	y = env->y;	1074	y = env->y;
		1075
		1076	// make sure cmov optimisation is applicable
		1077	*(above ? &above->below : &env->inv) = below;
		1078	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1079
1089	above = 0;	1080	above = 0;
1090	below = 0;	1081	below = 0;
1091	env = 0;	1082	env = 0;
1092		1083
1093	/* NO_FIX_PLAYER is set when a great many changes are being	1084	/* NO_FIX_PLAYER is set when a great many changes are being
…		…
1123		1114
1124	esrv_del_item (pl->contr, count);	1115	esrv_del_item (pl->contr, count);
1125	}	1116	}
1126		1117
1127	/* link the object above us */	1118	/* link the object above us */
1128	if (above)	1119	// re-link, make sure compiler can easily use cmove
1129	above->below = below;	1120	*(above ? &above->below : &ms.top) = below;
1130	else	1121	*(below ? &below->above : &ms.bot) = above;
1131	ms.top = below; /* we were top, set new top */
1132
1133	/* Relink the object below us, if there is one */
1134	if (below)
1135	below->above = above;
1136	else
1137	{
1138	/* Nothing below, which means we need to relink map object for this space
1139	* use translated coordinates in case some oddness with map tiling is
1140	* evident
1141	*/
1142	if (GET_MAP_OB (map, x, y) != this)
1143	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 ());
1144
1145	ms.bot = above; /* goes on above it. */
1146	}
1147		1122
1148	above = 0;	1123	above = 0;
1149	below = 0;	1124	below = 0;
1150		1125
1151	if (map->in_memory == MAP_SAVING)	1126	if (map->in_memory == MAP_SAVING)
…		…
1161	* appropriately.	1136	* appropriately.
1162	*/	1137	*/
1163	pl->close_container ();	1138	pl->close_container ();
1164		1139
1165	//TODO: the floorbox prev/next might need updating	1140	//TODO: the floorbox prev/next might need updating
1166	esrv_del_item (pl->contr, count);	1141	//esrv_del_item (pl->contr, count);
		1142	//TODO: update floorbox to preserve ordering
		1143	if (pl->contr->ns)
		1144	pl->contr->ns->floorbox_update ();
1167	}	1145	}
1168		1146
1169	for (tmp = ms.bot; tmp; tmp = tmp->above)	1147	for (tmp = ms.bot; tmp; tmp = tmp->above)
1170	{	1148	{
1171	/* No point updating the players look faces if he is the object	1149	/* No point updating the players look faces if he is the object
…		…
1295	* just 'op' otherwise	1273	* just 'op' otherwise
1296	*/	1274	*/
1297	object *	1275	object *
1298	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1276	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1299	{	1277	{
1300	assert (!op->flag [FLAG_FREED]);
1301
1302	op->remove ();	1278	op->remove ();
1303		1279
1304	/* Ideally, the caller figures this out. However, it complicates a lot	1280	/* Ideally, the caller figures this out. However, it complicates a lot
1305	* of areas of callers (eg, anything that uses find_free_spot would now	1281	* of areas of callers (eg, anything that uses find_free_spot would now
1306	* need extra work	1282	* need extra work
1307	*/	1283	*/
1308	if (!xy_normalise (m, op->x, op->y))	1284	if (!xy_normalise (m, op->x, op->y))
1309	{	1285	{
1310	op->destroy (1);	1286	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1311	return 0;	1287	return 0;
1312	}	1288	}
1313		1289
1314	if (object *more = op->more)	1290	if (object *more = op->more)
1315	if (!insert_ob_in_map (more, m, originator, flag))	1291	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1324	*/	1300	*/
1325	if (op->nrof && !(flag & INS_NO_MERGE))	1301	if (op->nrof && !(flag & INS_NO_MERGE))
1326	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1302	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1327	if (object::can_merge (op, tmp))	1303	if (object::can_merge (op, tmp))
1328	{	1304	{
1329	// TODO: we atcually want to update tmp, not op,	1305	// TODO: we actually want to update tmp, not op,
1330	// but some caller surely breaks when we return tmp	1306	// but some caller surely breaks when we return tmp
1331	// from here :/	1307	// from here :/
1332	op->nrof += tmp->nrof;	1308	op->nrof += tmp->nrof;
1333	tmp->destroy (1);	1309	tmp->destroy (1);
1334	}	1310	}
…		…
1345	{	1321	{
1346	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1322	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1347	abort ();	1323	abort ();
1348	}	1324	}
1349		1325
		1326	if (!originator->is_on_map ())
		1327	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1328	op->debug_desc (), originator->debug_desc ());
		1329
1350	op->above = originator;	1330	op->above = originator;
1351	op->below = originator->below;	1331	op->below = originator->below;
1352
1353	if (op->below)
1354	op->below->above = op;
1355	else
1356	ms.bot = op;
1357
1358	/* since below originator, no need to update top */
1359	originator->below = op;	1332	originator->below = op;
		1333
		1334	*(op->below ? &op->below->above : &ms.bot) = op;
1360	}	1335	}
1361	else	1336	else
1362	{	1337	{
1363	object top, floor = NULL;	1338	object *floor = 0;
1364		1339	object *top = ms.top;
1365	top = ms.bot;
1366		1340
1367	/* If there are other objects, then */	1341	/* If there are other objects, then */
1368	if (top)	1342	if (top)
1369	{	1343	{
1370	object *last = 0;
1371
1372	/*	1344	/*
1373	* If there are multiple objects on this space, we do some trickier handling.	1345	* If there are multiple objects on this space, we do some trickier handling.
1374	* We've already dealt with merging if appropriate.	1346	* We've already dealt with merging if appropriate.
1375	* Generally, we want to put the new object on top. But if	1347	* Generally, we want to put the new object on top. But if
1376	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1348	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1379	* once we get to them. This reduces the need to traverse over all of	1351	* once we get to them. This reduces the need to traverse over all of
1380	* them when adding another one - this saves quite a bit of cpu time	1352	* them when adding another one - this saves quite a bit of cpu time
1381	* when lots of spells are cast in one area. Currently, it is presumed	1353	* when lots of spells are cast in one area. Currently, it is presumed
1382	* that flying non pickable objects are spell objects.	1354	* that flying non pickable objects are spell objects.
1383	*/	1355	*/
1384	for (top = ms.bot; top; top = top->above)	1356	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1385	{	1357	{
1386	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1358	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) \|\| QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1387	floor = top;	1359	floor = tmp;
1388		1360
1389	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1361	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1390	{	1362	{
1391	/* We insert above top, so we want this object below this */	1363	/* We insert above top, so we want this object below this */
1392	top = top->below;	1364	top = tmp->below;
1393	break;	1365	break;
1394	}	1366	}
1395		1367
1396	last = top;	1368	top = tmp;
1397	}	1369	}
1398
1399	/* Don't want top to be NULL, so set it to the last valid object */
1400	top = last;
1401		1370
1402	/* We let update_position deal with figuring out what the space	1371	/* We let update_position deal with figuring out what the space
1403	* looks like instead of lots of conditions here.	1372	* looks like instead of lots of conditions here.
1404	* makes things faster, and effectively the same result.	1373	* makes things faster, and effectively the same result.
1405	*/	1374	*/
…		…
1412	*/	1381	*/
1413	if (!(flag & INS_ON_TOP)	1382	if (!(flag & INS_ON_TOP)
1414	&& ms.flags () & P_BLOCKSVIEW	1383	&& ms.flags () & P_BLOCKSVIEW
1415	&& (op->face && !faces [op->face].visibility))	1384	&& (op->face && !faces [op->face].visibility))
1416	{	1385	{
		1386	object *last;
		1387
1417	for (last = top; last != floor; last = last->below)	1388	for (last = top; last != floor; last = last->below)
1418	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1389	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1419	break;	1390	break;
1420		1391
1421	/* Check to see if we found the object that blocks view,	1392	/* Check to see if we found the object that blocks view,
…		…
1429	} /* If objects on this space */	1400	} /* If objects on this space */
1430		1401
1431	if (flag & INS_ABOVE_FLOOR_ONLY)	1402	if (flag & INS_ABOVE_FLOOR_ONLY)
1432	top = floor;	1403	top = floor;
1433		1404
1434	/* Top is the object that our object (op) is going to get inserted above.	1405	// insert object above top, or bottom-most if top = 0
1435	*/
1436
1437	/* First object on this space */
1438	if (!top)	1406	if (!top)
1439	{	1407	{
		1408	op->below = 0;
1440	op->above = ms.bot;	1409	op->above = ms.bot;
1441
1442	if (op->above)
1443	op->above->below = op;
1444
1445	op->below = 0;
1446	ms.bot = op;	1410	ms.bot = op;
		1411
		1412	*(op->above ? &op->above->below : &ms.top) = op;
1447	}	1413	}
1448	else	1414	else
1449	{ /* get inserted into the stack above top */	1415	{
1450	op->above = top->above;	1416	op->above = top->above;
1451
1452	if (op->above)
1453	op->above->below = op;	1417	top->above = op;
1454		1418
1455	op->below = top;	1419	op->below = top;
1456	top->above = op;	1420	*(op->above ? &op->above->below : &ms.top) = op;
1457	}	1421	}
1458		1422	}
1459	if (!op->above)
1460	ms.top = op;
1461	} /* else not INS_BELOW_ORIGINATOR */
1462		1423
1463	if (op->type == PLAYER)	1424	if (op->type == PLAYER)
1464	{	1425	{
1465	op->contr->do_los = 1;	1426	op->contr->do_los = 1;
1466	++op->map->players;	1427	++op->map->players;
…		…
1469		1430
1470	op->map->dirty = true;	1431	op->map->dirty = true;
1471		1432
1472	if (object *pl = ms.player ())	1433	if (object *pl = ms.player ())
1473	//TODO: the floorbox prev/next might need updating	1434	//TODO: the floorbox prev/next might need updating
1474	esrv_send_item (pl, op);	1435	//esrv_send_item (pl, op);
		1436	//TODO: update floorbox to preserve ordering
		1437	if (pl->contr->ns)
		1438	pl->contr->ns->floorbox_update ();
1475		1439
1476	/* If this object glows, it may affect lighting conditions that are	1440	/* If this object glows, it may affect lighting conditions that are
1477	* visible to others on this map. But update_all_los is really	1441	* visible to others on this map. But update_all_los is really
1478	* an inefficient way to do this, as it means los for all players	1442	* an inefficient way to do this, as it means los for all players
1479	* on the map will get recalculated. The players could very well	1443	* on the map will get recalculated. The players could very well
…		…
1599	}	1563	}
1600	else	1564	else
1601	{	1565	{
1602	decrease (nr);	1566	decrease (nr);
1603		1567
1604	object *op = object_create_clone (this);	1568	object *op = deep_clone ();
1605	op->nrof = nr;	1569	op->nrof = nr;
1606	return op;	1570	return op;
1607	}	1571	}
1608	}	1572	}
1609		1573
…		…
1830	LOG (llevError, "Present_arch called outside map.\n");	1794	LOG (llevError, "Present_arch called outside map.\n");
1831	return NULL;	1795	return NULL;
1832	}	1796	}
1833		1797
1834	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1798	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1835	if (tmp->arch == at)	1799	if (tmp->arch->archname == at->archname)
1836	return tmp;	1800	return tmp;
1837		1801
1838	return NULL;	1802	return NULL;
1839	}	1803	}
1840		1804
…		…
1904	* The first matching object is returned, or NULL if none.	1868	* The first matching object is returned, or NULL if none.
1905	*/	1869	*/
1906	object *	1870	object *
1907	present_arch_in_ob (const archetype at, const object op)	1871	present_arch_in_ob (const archetype at, const object op)
1908	{	1872	{
1909	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1873	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1910	if (tmp->arch == at)	1874	if (tmp->arch->archname == at->archname)
1911	return tmp;	1875	return tmp;
1912		1876
1913	return NULL;	1877	return NULL;
1914	}	1878	}
1915		1879
…		…
2324		2288
2325	/*	2289	/*
2326	* create clone from object to another	2290	* create clone from object to another
2327	*/	2291	*/
2328	object *	2292	object *
2329	object_create_clone (object *asrc)	2293	object::deep_clone ()
2330	{	2294	{
2331	object dst = 0, tmp, src, prev, *item;	2295	assert (("deep_clone called on non-head object", is_head ()));
2332		2296
2333	if (!asrc)	2297	object *dst = clone ();
2334	return 0;
2335		2298
2336	src = asrc->head_ ();	2299	object *prev = dst;
2337
2338	prev = 0;
2339	for (object *part = src; part; part = part->more)	2300	for (object *part = this->more; part; part = part->more)
2340	{	2301	{
2341	tmp = part->clone ();	2302	object *tmp = part->clone ();
2342	tmp->x -= src->x;
2343	tmp->y -= src->y;
2344
2345	if (!part->head)
2346	{
2347	dst = tmp;
2348	tmp->head = 0;
2349	}
2350	else
2351	tmp->head = dst;	2303	tmp->head = dst;
2352
2353	tmp->more = 0;
2354
2355	if (prev)
2356	prev->more = tmp;	2304	prev->more = tmp;
2357
2358	prev = tmp;	2305	prev = tmp;
2359	}	2306	}
2360		2307
2361	for (item = src->inv; item; item = item->below)	2308	for (object *item = inv; item; item = item->below)
2362	insert_ob_in_ob (object_create_clone (item), dst);	2309	insert_ob_in_ob (item->deep_clone (), dst);
2363		2310
2364	return dst;	2311	return dst;
2365	}	2312	}
2366		2313
2367	/* This returns the first object in who's inventory that	2314	/* This returns the first object in who's inventory that
…		…
2376	return tmp;	2323	return tmp;
2377		2324
2378	return 0;	2325	return 0;
2379	}	2326	}
2380		2327
2381	/* If ob has a field named key, return the link from the list,	2328	const shstr &
2382	* otherwise return NULL.	2329	object::kv_get (const shstr &key) const
2383	*
2384	* key must be a passed in shared string - otherwise, this won't
2385	* do the desired thing.
2386	*/
2387	key_value *
2388	get_ob_key_link (const object ob, const char key)
2389	{	2330	{
2390	for (key_value *link = ob->key_values; link; link = link->next)	2331	for (key_value *kv = key_values; kv; kv = kv->next)
2391	if (link->key == key)	2332	if (kv->key == key)
2392	return link;
2393
2394	return 0;
2395	}
2396
2397	/*
2398	* Returns the value of op has an extra_field for key, or NULL.
2399	*
2400	* The argument doesn't need to be a shared string.
2401	*
2402	* The returned string is shared.
2403	*/
2404	const char *
2405	get_ob_key_value (const object op, const char const key)
2406	{
2407	key_value *link;
2408	shstr_cmp canonical_key (key);
2409
2410	if (!canonical_key)
2411	{
2412	/* 1. There being a field named key on any object
2413	* implies there'd be a shared string to find.
2414	* 2. Since there isn't, no object has this field.
2415	* 3. Therefore, this object doesn't have this field.
2416	*/
2417	return 0;
2418	}
2419
2420	/* This is copied from get_ob_key_link() above -
2421	* only 4 lines, and saves the function call overhead.
2422	*/
2423	for (link = op->key_values; link; link = link->next)
2424	if (link->key == canonical_key)
2425	return link->value;	2333	return kv->value;
2426		2334
2427	return 0;	2335	return shstr_null;
2428	}	2336	}
2429		2337
2430	/*	2338	void
2431	* Updates the canonical_key in op to value.	2339	object::kv_set (const shstr &key, const shstr &value)
2432	*
2433	* canonical_key is a shared string (value doesn't have to be).
2434	*
2435	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2436	* keys.
2437	*
2438	* Returns TRUE on success.
2439	*/
2440	int
2441	set_ob_key_value_s (object op, const shstr & canonical_key, const char value, int add_key)
2442	{	2340	{
2443	key_value field = NULL, last = NULL;	2341	for (key_value *kv = key_values; kv; kv = kv->next)
2444		2342	if (kv->key == key)
2445	for (field = op->key_values; field != NULL; field = field->next)
2446	{
2447	if (field->key != canonical_key)
2448	{	2343	{
2449	last = field;	2344	kv->value = value;
2450	continue;	2345	return;
2451	}	2346	}
2452		2347
2453	if (value)	2348	key_value *kv = new key_value;
2454	field->value = value;	2349
2455	else	2350	kv->next = key_values;
		2351	kv->key = key;
		2352	kv->value = value;
		2353
		2354	key_values = kv;
		2355	}
		2356
		2357	void
		2358	object::kv_del (const shstr &key)
		2359	{
		2360	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
		2361	if ((*kvp)->key == key)
2456	{	2362	{
2457	/* Basically, if the archetype has this key set,	2363	key_value kv = kvp;
2458	* we need to store the null value so when we save	2364	kvp = (kvp)->next;
2459	* it, we save the empty value so that when we load,	2365	delete kv;
2460	* we get this value back again.	2366	return;
2461	*/
2462	if (get_ob_key_link (op->arch, canonical_key))
2463	field->value = 0;
2464	else
2465	{
2466	if (last)
2467	last->next = field->next;
2468	else
2469	op->key_values = field->next;
2470
2471	delete field;
2472	}
2473	}	2367	}
2474	return TRUE;
2475	}
2476	/* IF we get here, key doesn't exist */
2477
2478	/* No field, we'll have to add it. */
2479
2480	if (!add_key)
2481	return FALSE;
2482
2483	/* There isn't any good reason to store a null
2484	* value in the key/value list. If the archetype has
2485	* this key, then we should also have it, so shouldn't
2486	* be here. If user wants to store empty strings,
2487	* should pass in ""
2488	*/
2489	if (value == NULL)
2490	return TRUE;
2491
2492	field = new key_value;
2493
2494	field->key = canonical_key;
2495	field->value = value;
2496	/* Usual prepend-addition. */
2497	field->next = op->key_values;
2498	op->key_values = field;
2499
2500	return TRUE;
2501	}
2502
2503	/*
2504	* Updates the key in op to value.
2505	*
2506	* If add_key is FALSE, this will only update existing keys,
2507	* and not add new ones.
2508	* In general, should be little reason FALSE is ever passed in for add_key
2509	*
2510	* Returns TRUE on success.
2511	*/
2512	int
2513	set_ob_key_value (object op, const char key, const char *value, int add_key)
2514	{
2515	shstr key_ (key);
2516
2517	return set_ob_key_value_s (op, key_, value, add_key);
2518	}	2368	}
2519		2369
2520	object::depth_iterator::depth_iterator (object *container)	2370	object::depth_iterator::depth_iterator (object *container)
2521	: iterator_base (container)	2371	: iterator_base (container)
2522	{	2372	{
…		…
2572	{	2422	{
2573	char flagdesc[512];	2423	char flagdesc[512];
2574	char info2[256 * 4];	2424	char info2[256 * 4];
2575	char *p = info;	2425	char *p = info;
2576		2426
2577	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2427	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2578	count,	2428	count,
2579	uuid.c_str (),	2429	uuid.c_str (),
2580	&name,	2430	&name,
2581	title ? "\",title:\"" : "",	2431	title ? ",title:\"" : "",
2582	title ? (const char *)title : "",	2432	title ? (const char *)title : "",
		2433	title ? "\"" : "",
2583	flag_desc (flagdesc, 512), type);	2434	flag_desc (flagdesc, 512), type);
2584		2435
2585	if (!flag[FLAG_REMOVED] && env)	2436	if (!flag[FLAG_REMOVED] && env)
2586	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2437	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2587		2438

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.223 by root, Wed Apr 30 08:29:31 2008 UTC vs. Revision 1.243 by root, Sat May 17 00:17:02 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.223 by root, Wed Apr 30 08:29:31 2008 UTC vs.
Revision 1.243 by root, Sat May 17 00:17:02 2008 UTC