ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.204 by root, Fri Apr 11 17:01:52 2008 UTC vs.
Revision 1.241 by root, Wed May 7 19:19:09 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
…		…
140	{	136	{
141	read_uuid ();	137	read_uuid ();
142	}	138	}
143		139
144	/* 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. */
145	static int	141	static bool
146	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
147	{	143	{
148	key_value *wants_field;
149
150	/* 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
151	* 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
152	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
153	*/	147	*/
154		148
155	/* For each field in wants, */	149	/* For each field in wants, */
156	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)
157	{	151	if (has->kv_get (kv->key) != kv->value)
158	key_value *has_field;	152	return false;
159
160	/* Look for a field in has with the same key. */
161	has_field = get_ob_key_link (has, wants_field->key);
162
163	if (has_field == NULL)
164	{
165	/* No field with that name. */
166	return FALSE;
167	}
168
169	/* Found the matching field. */
170	if (has_field->value != wants_field->value)
171	{
172	/* Values don't match, so this half of the comparison is false. */
173	return FALSE;
174	}
175
176	/* If we get here, we found a match. Now for the next field in wants. */
177	}
178		153
179	/* 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. */
180	return TRUE;	155	return true;
181	}	156	}
182		157
183	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
184	static int	159	static bool
185	compare_ob_value_lists (const object *ob1, const object *ob2)	160	compare_ob_value_lists (const object *ob1, const object *ob2)
186	{	161	{
187	/* 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,
188	* so we need to run the comparison *twice*. :(	163	* so we need to run the comparison *twice*. :(
189	*/	164	*/
190	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);
191	}	167	}
192		168
193	/* 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
194	* they can be merged together.	170	* they can be merged together.
195	*	171	*
…		…
210	|| ob1->speed != ob2->speed	186	|| ob1->speed != ob2->speed
211	|| ob1->value != ob2->value	187	|| ob1->value != ob2->value
212	|| ob1->name != ob2->name)	188	|| ob1->name != ob2->name)
213	return 0;	189	return 0;
214		190
215	//TODO: this ain't working well, use nicer and correct overflow check	191	/* Do not merge objects if nrof would overflow. First part checks
216	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	192	* for unsigned overflow (2c), second part checks whether the result
217	* value could not be stored in a sint32 (which unfortunately sometimes is	193	* would fit into a 32 bit signed int, which is often used to hold
218	* used to store nrof).	194	* nrof values.
219	*/	195	*/
220	if (ob1->nrof + ob2->nrof >= 1UL << 31)	196	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
221	return 0;	197	return 0;
222		198
223	/* If the objects have been identified, set the BEEN_APPLIED flag.	199	/* If the objects have been identified, set the BEEN_APPLIED flag.
224	* This is to the comparison of the flags below will be OK. We	200	* This is to the comparison of the flags below will be OK. We
225	* just can't ignore the been applied or identified flags, as they	201	* just can't ignore the been applied or identified flags, as they
226	* are not equal - just if it has been identified, the been_applied	202	* are not equal - just if it has been identified, the been_applied
227	* flags lose any meaning.	203	* flags lose any meaning.
228	*/	204	*/
229	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	205	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
230	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
231		207
232	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
233	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
234		210
235	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	211	if (ob1->arch->name != ob2->arch->name
236	|| ob1->arch != ob2->arch
237	|| ob1->name != ob2->name	212	|| ob1->name != ob2->name
238	|| ob1->title != ob2->title	213	|| ob1->title != ob2->title
239	|| ob1->msg != ob2->msg	214	|| ob1->msg != ob2->msg
240	|| ob1->weight != ob2->weight	215	|| ob1->weight != ob2->weight
241	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
242	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
243	|| ob1->attacktype != ob2->attacktype	216	|| ob1->attacktype != ob2->attacktype
244	|| ob1->magic != ob2->magic	217	|| ob1->magic != ob2->magic
245	|| ob1->slaying != ob2->slaying	218	|| ob1->slaying != ob2->slaying
246	|| ob1->skill != ob2->skill	219	|| ob1->skill != ob2->skill
247	|| ob1->value != ob2->value	220	|| ob1->value != ob2->value
…		…
254	|| ob1->move_block != ob2->move_block	227	|| ob1->move_block != ob2->move_block
255	|| ob1->move_allow != ob2->move_allow	228	|| ob1->move_allow != ob2->move_allow
256	|| ob1->move_on != ob2->move_on	229	|| ob1->move_on != ob2->move_on
257	|| ob1->move_off != ob2->move_off	230	|| ob1->move_off != ob2->move_off
258	|| ob1->move_slow != ob2->move_slow	231	|| ob1->move_slow != ob2->move_slow
259	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	232	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
260	return 0;	235	return 0;
261		236
		237	if ((ob1->flag ^ ob2->flag)
		238	.reset (FLAG_INV_LOCKED)
		239	.reset (FLAG_CLIENT_SENT)
		240	.reset (FLAG_REMOVED)
		241	.any ())
		242	return 0;
		243
262	/* This is really a spellbook check - really, we should	244	/* This is really a spellbook check - we should in general
263	* check all objects in the inventory.	245	* not merge objects with real inventories, as splitting them
		246	* is hard.
264	*/	247	*/
265	if (ob1->inv || ob2->inv)	248	if (ob1->inv || ob2->inv)
266	{	249	{
267	if (!(ob1->inv && ob2->inv))	250	if (!(ob1->inv && ob2->inv))
268	return 0; /* inventories differ in length */	251	return 0; /* inventories differ in length */
269		252
270	if (ob1->inv->below || ob2->inv->below)	253	if (ob1->inv->below || ob2->inv->below)
271	return 0; /* more than one object in inv */	254	return 0; /* more than one object in inv */
272		255
273	if (!object::can_merge (ob1->inv, ob2->inv))	256	if (!object::can_merge (ob1->inv, ob2->inv))
274	return 0; /* inventory objexts differ */	257	return 0; /* inventory objects differ */
275		258
276	/* inventory ok - still need to check rest of this object to see	259	/* inventory ok - still need to check rest of this object to see
277	* if it is valid.	260	* if it is valid.
278	*/	261	*/
279	}	262	}
…		…
298	if (ob1->level != ob2->level)	281	if (ob1->level != ob2->level)
299	return 0;	282	return 0;
300	break;	283	break;
301	}	284	}
302		285
303	if (ob1->key_values != NULL || ob2->key_values != NULL)	286	if (ob1->key_values || ob2->key_values)
304	{	287	{
305	/* At least one of these has key_values. */	288	/* At least one of these has key_values. */
306	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	289	if ((!ob1->key_values) != (!ob2->key_values))
307	/* One has fields, but the other one doesn't. */	290	return 0; /* One has fields, but the other one doesn't. */
308	return 0;	291
309	else if (!compare_ob_value_lists (ob1, ob2))	292	if (!compare_ob_value_lists (ob1, ob2))
310	return 0;	293	return 0;
311	}	294	}
312		295
313	if (ob1->self || ob2->self)	296	if (ob1->self || ob2->self)
314	{	297	{
…		…
320	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;	303	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
321	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;	304	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
322		305
323	if (k1 != k2)	306	if (k1 != k2)
324	return 0;	307	return 0;
		308
325	else if (k1 == 0)	309	if (k1 == 0)
326	return 1;	310	return 1;
		311
327	else if (!cfperl_can_merge (ob1, ob2))	312	if (!cfperl_can_merge (ob1, ob2))
328	return 0;	313	return 0;
329	}	314	}
330	}	315	}
331		316
332	/* Everything passes, must be OK. */	317	/* Everything passes, must be OK. */
333	return 1;	318	return 1;
334	}	319	}
335		320
		321	// find player who can see this object
		322	object *
		323	object::visible_to () const
		324	{
		325	if (client_visible () && !flag [FLAG_REMOVED])
		326	{
		327	// see if we are in a container of sorts
		328	if (env)
		329	{
		330	// the player inventory itself is always visible
		331	if (env->type == PLAYER)
		332	return env;
		333
		334	// else a player could have our env open
		335	object *envest = env->outer_env ();
		336
		337	// the player itself is always on a map, so we will find him here
		338	// even if our inv is in a player.
		339	if (envest->is_on_map ())
		340	if (object *pl = envest->ms ().player ())
		341	if (pl->container == env)
		342	return pl;
		343	}
		344	else
		345	{
		346	// maybe there is a player standing on the same mapspace
		347	// this will catch the case where "this" is a player
		348	if (object *pl = ms ().player ())
		349	if (!pl->container || this == pl->container)
		350	return pl;
		351	}
		352	}
		353
		354	return 0;
		355	}
		356
		357	// adjust weight per container type ("of holding")
		358	static sint32
		359	weight_adjust_for (object *op, sint32 weight)
		360	{
		361	return op->type == CONTAINER
		362	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		363	: weight;
		364	}
		365
336	/*	366	/*
		367	* adjust_weight(object, weight) adds the specified weight to an object,
		368	* and also updates how much the environment(s) is/are carrying.
		369	*/
		370	static void
		371	adjust_weight (object *op, sint32 weight)
		372	{
		373	while (op)
		374	{
		375	// adjust by actual difference to account for rounding errors
		376	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		377	weight = weight_adjust_for (op, op->carrying)
		378	- weight_adjust_for (op, op->carrying - weight);
		379
		380	if (!weight)
		381	return;
		382
		383	op->carrying += weight;
		384
		385	if (object *pl = op->visible_to ())
		386	if (pl != op) // player is handled lazily
		387	esrv_update_item (UPD_WEIGHT, pl, op);
		388
		389	op = op->env;
		390	}
		391	}
		392
		393	/*
337	* sum_weight() is a recursive function which calculates the weight	394	* this is a recursive function which calculates the weight
338	* an object is carrying. It goes through in figures out how much	395	* an object is carrying. It goes through op and figures out how much
339	* containers are carrying, and sums it up.	396	* containers are carrying, and sums it up.
340	*/	397	*/
341	long	398	void
342	sum_weight (object *op)	399	object::update_weight ()
343	{	400	{
344	long sum;	401	sint32 sum = 0;
345	object *inv;
346		402
347	for (sum = 0, inv = op->inv; inv; inv = inv->below)	403	for (object *op = inv; op; op = op->below)
348	{	404	{
349	if (inv->inv)	405	if (op->inv)
350	sum_weight (inv);	406	op->update_weight ();
351		407
352	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	408	sum += op->total_weight ();
		409	}
		410
		411	sum = weight_adjust_for (this, sum);
		412
		413	if (sum != carrying)
353	}	414	{
354
355	if (op->type == CONTAINER && op->stats.Str)
356	sum = (sum * (100 - op->stats.Str)) / 100;
357
358	if (op->carrying != sum)
359	op->carrying = sum;	415	carrying = sum;
360		416
361	return sum;	417	if (object *pl = visible_to ())
		418	if (pl != this) // player is handled lazily
		419	esrv_update_item (UPD_WEIGHT, pl, this);
		420	}
362	}	421	}
363		422
364	/**	423	/*
365	* Return the outermost environment object for a given object.	424	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
366	*/
367
368	object *
369	object_get_env_recursive (object *op)
370	{
371	while (op->env != NULL)
372	op = op->env;
373	return op;
374	}
375
376	/*
377	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
378	* Some error messages.
379	* The result of the dump is stored in the static global errmsg array.
380	*/	425	*/
381	char *	426	char *
382	dump_object (object *op)	427	dump_object (object *op)
383	{	428	{
384	if (!op)	429	if (!op)
…		…
398	get_nearest_part (object *op, const object *pl)	443	get_nearest_part (object *op, const object *pl)
399	{	444	{
400	object *tmp, *closest;	445	object *tmp, *closest;
401	int last_dist, i;	446	int last_dist, i;
402		447
403	if (op->more == NULL)	448	if (!op->more)
404	return op;	449	return op;
		450
405	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	451	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		452	tmp;
		453	tmp = tmp->more)
406	if ((i = distance (tmp, pl)) < last_dist)	454	if ((i = distance (tmp, pl)) < last_dist)
407	closest = tmp, last_dist = i;	455	closest = tmp, last_dist = i;
		456
408	return closest;	457	return closest;
409	}	458	}
410		459
411	/*	460	/*
412	* Returns the object which has the count-variable equal to the argument.	461	* Returns the object which has the count-variable equal to the argument.
		462	* VERRRY slow.
413	*/	463	*/
414	object *	464	object *
415	find_object (tag_t i)	465	find_object (tag_t i)
416	{	466	{
417	for_all_objects (op)	467	for_all_objects (op)
…		…
542	}	592	}
543		593
544	op->key_values = 0;	594	op->key_values = 0;
545	}	595	}
546		596
547	object &	597	/*
548	object::operator =(const object &src)	598	* copy_to first frees everything allocated by the dst object,
		599	* and then copies the contents of itself into the second
		600	* object, allocating what needs to be allocated. Basically, any
		601	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		602	* if the first object is freed, the pointers in the new object
		603	* will point at garbage.
		604	*/
		605	void
		606	object::copy_to (object *dst)
549	{	607	{
550	bool is_freed = flag [FLAG_FREED];	608	dst->remove ();
551	bool is_removed = flag [FLAG_REMOVED];
552
553	*(object_copy *)this = src;	609	*(object_copy *)dst = *this;
554
555	flag [FLAG_FREED] = is_freed;
556	flag [FLAG_REMOVED] = is_removed;	610	dst->flag [FLAG_REMOVED] = true;
557		611
558	/* Copy over key_values, if any. */	612	/* Copy over key_values, if any. */
559	if (src.key_values)	613	if (key_values)
560	{	614	{
561	key_value *tail = 0;	615	key_value *tail = 0;
562	key_values = 0;	616	dst->key_values = 0;
563		617
564	for (key_value *i = src.key_values; i; i = i->next)	618	for (key_value *i = key_values; i; i = i->next)
565	{	619	{
566	key_value *new_link = new key_value;	620	key_value *new_link = new key_value;
567		621
568	new_link->next = 0;	622	new_link->next = 0;
569	new_link->key = i->key;	623	new_link->key = i->key;
570	new_link->value = i->value;	624	new_link->value = i->value;
571		625
572	/* Try and be clever here, too. */	626	/* Try and be clever here, too. */
573	if (!key_values)	627	if (!dst->key_values)
574	{	628	{
575	key_values = new_link;	629	dst->key_values = new_link;
576	tail = new_link;	630	tail = new_link;
577	}	631	}
578	else	632	else
579	{	633	{
580	tail->next = new_link;	634	tail->next = new_link;
581	tail = new_link;	635	tail = new_link;
582	}	636	}
583	}	637	}
584	}	638	}
585	}
586
587	/*
588	* copy_to first frees everything allocated by the dst object,
589	* and then copies the contents of itself into the second
590	* object, allocating what needs to be allocated. Basically, any
591	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
592	* if the first object is freed, the pointers in the new object
593	* will point at garbage.
594	*/
595	void
596	object::copy_to (object *dst)
597	{
598	*dst = *this;
599		639
600	if (speed < 0)	640	if (speed < 0)
601	dst->speed_left -= rndm ();	641	dst->speed_left -= rndm ();
602		642
603	dst->set_speed (dst->speed);	643	dst->set_speed (dst->speed);
…		…
625	object *	665	object *
626	object::clone ()	666	object::clone ()
627	{	667	{
628	object *neu = create ();	668	object *neu = create ();
629	copy_to (neu);	669	copy_to (neu);
		670	neu->map = map; // not copied by copy_to
630	return neu;	671	return neu;
631	}	672	}
632		673
633	/*	674	/*
634	* If an object with the IS_TURNABLE() flag needs to be turned due	675	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
685	* UP_OBJ_FACE: only the objects face has changed.	726	* UP_OBJ_FACE: only the objects face has changed.
686	*/	727	*/
687	void	728	void
688	update_object (object *op, int action)	729	update_object (object *op, int action)
689	{	730	{
690	if (op == NULL)	731	if (!op)
691	{	732	{
692	/* this should never happen */	733	/* this should never happen */
693	LOG (llevDebug, "update_object() called for NULL object.\n");	734	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
694	return;	735	return;
695	}	736	}
696		737
697	if (op->env)	738	if (!op->is_on_map ())
698	{	739	{
699	/* Animation is currently handled by client, so nothing	740	/* Animation is currently handled by client, so nothing
700	* to do in this case.	741	* to do in this case.
701	*/	742	*/
702	return;	743	return;
703	}	744	}
704
705	/* If the map is saving, don't do anything as everything is
706	* going to get freed anyways.
707	*/
708	if (!op->map || op->map->in_memory == MAP_SAVING)
709	return;
710		745
711	/* make sure the object is within map boundaries */	746	/* make sure the object is within map boundaries */
712	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	747	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
713	{	748	{
714	LOG (llevError, "update_object() called for object out of map!\n");	749	LOG (llevError, "update_object() called for object out of map!\n");
…		…
857	object::destroy_inv (bool drop_to_ground)	892	object::destroy_inv (bool drop_to_ground)
858	{	893	{
859	// need to check first, because the checks below might segfault	894	// need to check first, because the checks below might segfault
860	// as we might be on an invalid mapspace and crossfire code	895	// as we might be on an invalid mapspace and crossfire code
861	// is too buggy to ensure that the inventory is empty.	896	// is too buggy to ensure that the inventory is empty.
862	// corollary: if you create arrows etc. with stuff in tis inventory,	897	// corollary: if you create arrows etc. with stuff in its inventory,
863	// cf will crash below with off-map x and y	898	// cf will crash below with off-map x and y
864	if (!inv)	899	if (!inv)
865	return;	900	return;
866		901
867	/* Only if the space blocks everything do we not process -	902	/* Only if the space blocks everything do we not process -
868	* if some form of movement is allowed, let objects	903	* if some form of movement is allowed, let objects
869	* drop on that space.	904	* drop on that space.
870	*/	905	*/
871	if (!drop_to_ground	906	if (!drop_to_ground
872	|| !map	907	|| !map
873	|| map->in_memory != MAP_IN_MEMORY	908	|| map->in_memory != MAP_ACTIVE
874	|| map->nodrop	909	|| map->no_drop
875	|| ms ().move_block == MOVE_ALL)	910	|| ms ().move_block == MOVE_ALL)
876	{	911	{
877	while (inv)	912	while (inv)
878	{	913	{
879	inv->destroy_inv (drop_to_ground);	914	inv->destroy_inv (false);
880	inv->destroy ();	915	inv->destroy ();
881	}	916	}
882	}	917	}
883	else	918	else
884	{ /* Put objects in inventory onto this space */	919	{ /* Put objects in inventory onto this space */
…		…
890	|| op->flag [FLAG_NO_DROP]	925	|| op->flag [FLAG_NO_DROP]
891	|| op->type == RUNE	926	|| op->type == RUNE
892	|| op->type == TRAP	927	|| op->type == TRAP
893	|| op->flag [FLAG_IS_A_TEMPLATE]	928	|| op->flag [FLAG_IS_A_TEMPLATE]
894	|| op->flag [FLAG_DESTROY_ON_DEATH])	929	|| op->flag [FLAG_DESTROY_ON_DEATH])
895	op->destroy ();	930	op->destroy (true);
896	else	931	else
897	map->insert (op, x, y);	932	map->insert (op, x, y);
898	}	933	}
899	}	934	}
900	}	935	}
…		…
904	object *op = new object;	939	object *op = new object;
905	op->link ();	940	op->link ();
906	return op;	941	return op;
907	}	942	}
908		943
		944	static struct freed_map : maptile
		945	{
		946	freed_map ()
		947	{
		948	path = "<freed objects map>";
		949	name = "/internal/freed_objects_map";
		950	width = 3;
		951	height = 3;
		952	no_drop = 1;
		953	no_reset = 1;
		954
		955	alloc ();
		956	in_memory = MAP_ACTIVE;
		957	}
		958
		959	~freed_map ()
		960	{
		961	destroy ();
		962	}
		963	} freed_map; // freed objects are moved here to avoid crashes
		964
909	void	965	void
910	object::do_destroy ()	966	object::do_destroy ()
911	{	967	{
912	attachable::do_destroy ();
913
914	if (flag [FLAG_IS_LINKED])	968	if (flag [FLAG_IS_LINKED])
915	remove_button_link (this);	969	remove_button_link (this);
916		970
917	if (flag [FLAG_FRIENDLY])	971	if (flag [FLAG_FRIENDLY])
918	remove_friendly_object (this);	972	remove_friendly_object (this);
919		973
920	if (!flag [FLAG_REMOVED])
921	remove ();	974	remove ();
922		975
923	destroy_inv (true);	976	attachable::do_destroy ();
924		977
925	deactivate ();	978	deactivate ();
926	unlink ();	979	unlink ();
927		980
928	flag [FLAG_FREED] = 1;	981	flag [FLAG_FREED] = 1;
929		982
930	// hack to ensure that freed objects still have a valid map	983	// hack to ensure that freed objects still have a valid map
931	{
932	static maptile *freed_map; // freed objects are moved here to avoid crashes
933
934	if (!freed_map)
935	{
936	freed_map = new maptile;
937
938	freed_map->path = "<freed objects map>";
939	freed_map->name = "/internal/freed_objects_map";
940	freed_map->width = 3;
941	freed_map->height = 3;
942	freed_map->nodrop = 1;
943
944	freed_map->alloc ();
945	freed_map->in_memory = MAP_IN_MEMORY;
946	}
947
948	map = freed_map;	984	map = &freed_map;
949	x = 1;	985	x = 1;
950	y = 1;	986	y = 1;
951	}
952		987
953	if (more)	988	if (more)
954	{	989	{
955	more->destroy ();	990	more->destroy ();
956	more = 0;	991	more = 0;
…		…
969	object::destroy (bool destroy_inventory)	1004	object::destroy (bool destroy_inventory)
970	{	1005	{
971	if (destroyed ())	1006	if (destroyed ())
972	return;	1007	return;
973		1008
		1009	if (!is_head () && !head->destroyed ())
		1010	{
		1011	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1012	head->destroy (destroy_inventory);
		1013	return;
		1014	}
		1015
974	if (destroy_inventory)	1016	destroy_inv (!destroy_inventory);
975	destroy_inv (false);
976		1017
977	if (is_head ())	1018	if (is_head ())
978	if (sound_destroy)	1019	if (sound_destroy)
979	play_sound (sound_destroy);	1020	play_sound (sound_destroy);
980	else if (flag [FLAG_MONSTER])	1021	else if (flag [FLAG_MONSTER])
981	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1022	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
982		1023
983	attachable::destroy ();	1024	attachable::destroy ();
984	}
985
986	/*
987	* sub_weight() recursively (outwards) subtracts a number from the
988	* weight of an object (and what is carried by it's environment(s)).
989	*/
990	void
991	sub_weight (object *op, signed long weight)
992	{
993	while (op != NULL)
994	{
995	if (op->type == CONTAINER)
996	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
997
998	op->carrying -= weight;
999	op = op->env;
1000	}
1001	}	1025	}
1002		1026
1003	/* op->remove ():	1027	/* op->remove ():
1004	* This function removes the object op from the linked list of objects	1028	* This function removes the object op from the linked list of objects
1005	* which it is currently tied to. When this function is done, the	1029	* which it is currently tied to. When this function is done, the
…		…
1011	object::do_remove ()	1035	object::do_remove ()
1012	{	1036	{
1013	object *tmp, *last = 0;	1037	object *tmp, *last = 0;
1014	object *otmp;	1038	object *otmp;
1015		1039
1016	if (QUERY_FLAG (this, FLAG_REMOVED))	1040	if (flag [FLAG_REMOVED])
1017	return;	1041	return;
1018		1042
1019	SET_FLAG (this, FLAG_REMOVED);
1020	INVOKE_OBJECT (REMOVE, this);	1043	INVOKE_OBJECT (REMOVE, this);
		1044
		1045	flag [FLAG_REMOVED] = true;
1021		1046
1022	if (more)	1047	if (more)
1023	more->remove ();	1048	more->remove ();
1024		1049
1025	/*	1050	/*
1026	* In this case, the object to be removed is in someones	1051	* In this case, the object to be removed is in someones
1027	* inventory.	1052	* inventory.
1028	*/	1053	*/
1029	if (env)	1054	if (env)
1030	{	1055	{
1031	if (nrof)	1056	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1032	sub_weight (env, weight * nrof);	1057	if (object *pl = visible_to ())
1033	else	1058	esrv_del_item (pl->contr, count);
1034	sub_weight (env, weight + carrying);	1059	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1060
		1061	adjust_weight (env, -total_weight ());
		1062
		1063	/* we set up values so that it could be inserted into
		1064	* the map, but we don't actually do that - it is up
		1065	* to the caller to decide what we want to do.
		1066	*/
		1067	map = env->map;
		1068	x = env->x;
		1069	y = env->y;
		1070
		1071	// make sure cmov optimisation is applicable
		1072	*(above ? &above->below : &env->inv) = below;
		1073	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1074
		1075	above = 0;
		1076	below = 0;
		1077	env = 0;
1035		1078
1036	/* NO_FIX_PLAYER is set when a great many changes are being	1079	/* NO_FIX_PLAYER is set when a great many changes are being
1037	* made to players inventory. If set, avoiding the call	1080	* made to players inventory. If set, avoiding the call
1038	* to save cpu time.	1081	* to save cpu time.
1039	*/	1082	*/
1040	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1083	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1041	otmp->update_stats ();	1084	otmp->update_stats ();
1042
1043	if (above)
1044	above->below = below;
1045	else
1046	env->inv = below;
1047
1048	if (below)
1049	below->above = above;
1050
1051	/* we set up values so that it could be inserted into
1052	* the map, but we don't actually do that - it is up
1053	* to the caller to decide what we want to do.
1054	*/
1055	x = env->x, y = env->y;
1056	map = env->map;
1057	above = 0, below = 0;
1058	env = 0;
1059	}	1085	}
1060	else if (map)	1086	else if (map)
1061	{	1087	{
1062	if (type == PLAYER)
1063	{
1064	// leaving a spot always closes any open container on the ground
1065	if (container && !container->env)
1066	// this causes spurious floorbox updates, but it ensures
1067	// that the CLOSE event is being sent.
1068	close_container ();
1069
1070	--map->players;
1071	map->touch ();
1072	}
1073
1074	map->dirty = true;	1088	map->dirty = true;
1075	mapspace &ms = this->ms ();	1089	mapspace &ms = this->ms ();
1076		1090
		1091	if (object *pl = ms.player ())
		1092	{
		1093	if (type == PLAYER) // this == pl(!)
		1094	{
		1095	// leaving a spot always closes any open container on the ground
		1096	if (container && !container->env)
		1097	// this causes spurious floorbox updates, but it ensures
		1098	// that the CLOSE event is being sent.
		1099	close_container ();
		1100
		1101	--map->players;
		1102	map->touch ();
		1103	}
		1104	else if (pl->container == this)
		1105	{
		1106	// removing a container should close it
		1107	close_container ();
		1108	}
		1109
		1110	esrv_del_item (pl->contr, count);
		1111	}
		1112
1077	/* link the object above us */	1113	/* link the object above us */
1078	if (above)	1114	// re-link, make sure compiler can easily use cmove
1079	above->below = below;	1115	*(above ? &above->below : &ms.top) = below;
1080	else	1116	*(below ? &below->above : &ms.bot) = above;
1081	ms.top = below; /* we were top, set new top */
1082
1083	/* Relink the object below us, if there is one */
1084	if (below)
1085	below->above = above;
1086	else
1087	{
1088	/* Nothing below, which means we need to relink map object for this space
1089	* use translated coordinates in case some oddness with map tiling is
1090	* evident
1091	*/
1092	if (GET_MAP_OB (map, x, y) != this)
1093	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 ());
1094
1095	ms.bot = above; /* goes on above it. */
1096	}
1097		1117
1098	above = 0;	1118	above = 0;
1099	below = 0;	1119	below = 0;
1100		1120
1101	if (map->in_memory == MAP_SAVING)	1121	if (map->in_memory == MAP_SAVING)
…		…
1110	* removed (most likely destroyed), update the player view	1130	* removed (most likely destroyed), update the player view
1111	* appropriately.	1131	* appropriately.
1112	*/	1132	*/
1113	pl->close_container ();	1133	pl->close_container ();
1114		1134
		1135	//TODO: the floorbox prev/next might need updating
		1136	//esrv_del_item (pl->contr, count);
		1137	//TODO: update floorbox to preserve ordering
		1138	if (pl->contr->ns)
1115	pl->contr->ns->floorbox_update ();	1139	pl->contr->ns->floorbox_update ();
1116	}	1140	}
1117		1141
1118	for (tmp = ms.bot; tmp; tmp = tmp->above)	1142	for (tmp = ms.bot; tmp; tmp = tmp->above)
1119	{	1143	{
1120	/* No point updating the players look faces if he is the object	1144	/* No point updating the players look faces if he is the object
…		…
1164	if (!top)	1188	if (!top)
1165	for (top = op; top && top->above; top = top->above)	1189	for (top = op; top && top->above; top = top->above)
1166	;	1190	;
1167		1191
1168	for (; top; top = top->below)	1192	for (; top; top = top->below)
1169	{
1170	if (top == op)
1171	continue;
1172
1173	if (object::can_merge (op, top))	1193	if (object::can_merge (op, top))
1174	{	1194	{
1175	top->nrof += op->nrof;	1195	top->nrof += op->nrof;
1176		1196
1177	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1197	if (object *pl = top->visible_to ())
1178	op->weight = 0; /* Don't want any adjustements now */	1198	esrv_update_item (UPD_NROF, pl, top);
		1199
		1200	op->weight = 0; // cancel the addition above
		1201	op->carrying = 0; // must be 0 already
		1202
1179	op->destroy ();	1203	op->destroy (1);
		1204
1180	return top;	1205	return top;
1181	}	1206	}
1182	}
1183		1207
1184	return 0;	1208	return 0;
1185	}	1209	}
1186		1210
1187	void	1211	void
…		…
1244	* just 'op' otherwise	1268	* just 'op' otherwise
1245	*/	1269	*/
1246	object *	1270	object *
1247	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1271	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1248	{	1272	{
1249	assert (!op->flag [FLAG_FREED]);
1250
1251	object *top, *floor = NULL;
1252
1253	op->remove ();	1273	op->remove ();
1254		1274
1255	/* Ideally, the caller figures this out. However, it complicates a lot	1275	/* Ideally, the caller figures this out. However, it complicates a lot
1256	* of areas of callers (eg, anything that uses find_free_spot would now	1276	* of areas of callers (eg, anything that uses find_free_spot would now
1257	* need extra work	1277	* need extra work
1258	*/	1278	*/
1259	if (!xy_normalise (m, op->x, op->y))	1279	if (!xy_normalise (m, op->x, op->y))
1260	{	1280	{
1261	op->destroy ();	1281	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1262	return 0;	1282	return 0;
1263	}	1283	}
1264		1284
1265	if (object *more = op->more)	1285	if (object *more = op->more)
1266	if (!insert_ob_in_map (more, m, originator, flag))	1286	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1275	*/	1295	*/
1276	if (op->nrof && !(flag & INS_NO_MERGE))	1296	if (op->nrof && !(flag & INS_NO_MERGE))
1277	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1297	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1278	if (object::can_merge (op, tmp))	1298	if (object::can_merge (op, tmp))
1279	{	1299	{
		1300	// TODO: we actually want to update tmp, not op,
		1301	// but some caller surely breaks when we return tmp
		1302	// from here :/
1280	op->nrof += tmp->nrof;	1303	op->nrof += tmp->nrof;
1281	tmp->destroy ();	1304	tmp->destroy (1);
1282	}	1305	}
1283		1306
1284	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1307	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1285	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1308	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1286		1309
…		…
1293	{	1316	{
1294	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1317	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1295	abort ();	1318	abort ();
1296	}	1319	}
1297		1320
		1321	if (!originator->is_on_map ())
		1322	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1323	op->debug_desc (), originator->debug_desc ());
		1324
1298	op->above = originator;	1325	op->above = originator;
1299	op->below = originator->below;	1326	op->below = originator->below;
1300
1301	if (op->below)
1302	op->below->above = op;
1303	else
1304	ms.bot = op;
1305
1306	/* since *below* originator, no need to update top */
1307	originator->below = op;	1327	originator->below = op;
		1328
		1329	*(op->below ? &op->below->above : &ms.bot) = op;
1308	}	1330	}
1309	else	1331	else
1310	{	1332	{
1311	top = ms.bot;	1333	object *floor = 0;
		1334	object *top = ms.top;
1312		1335
1313	/* If there are other objects, then */	1336	/* If there are other objects, then */
1314	if (top)	1337	if (top)
1315	{	1338	{
1316	object *last = 0;
1317
1318	/*	1339	/*
1319	* If there are multiple objects on this space, we do some trickier handling.	1340	* If there are multiple objects on this space, we do some trickier handling.
1320	* We've already dealt with merging if appropriate.	1341	* We've already dealt with merging if appropriate.
1321	* Generally, we want to put the new object on top. But if	1342	* Generally, we want to put the new object on top. But if
1322	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1343	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1325	* once we get to them. This reduces the need to traverse over all of	1346	* once we get to them. This reduces the need to traverse over all of
1326	* them when adding another one - this saves quite a bit of cpu time	1347	* them when adding another one - this saves quite a bit of cpu time
1327	* when lots of spells are cast in one area. Currently, it is presumed	1348	* when lots of spells are cast in one area. Currently, it is presumed
1328	* that flying non pickable objects are spell objects.	1349	* that flying non pickable objects are spell objects.
1329	*/	1350	*/
1330	for (top = ms.bot; top; top = top->above)	1351	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1331	{	1352	{
1332	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1353	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1333	floor = top;	1354	floor = tmp;
1334		1355
1335	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1356	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1336	{	1357	{
1337	/* We insert above top, so we want this object below this */	1358	/* We insert above top, so we want this object below this */
1338	top = top->below;	1359	top = tmp->below;
1339	break;	1360	break;
1340	}	1361	}
1341		1362
1342	last = top;	1363	top = tmp;
1343	}	1364	}
1344
1345	/* Don't want top to be NULL, so set it to the last valid object */
1346	top = last;
1347		1365
1348	/* We let update_position deal with figuring out what the space	1366	/* We let update_position deal with figuring out what the space
1349	* looks like instead of lots of conditions here.	1367	* looks like instead of lots of conditions here.
1350	* makes things faster, and effectively the same result.	1368	* makes things faster, and effectively the same result.
1351	*/	1369	*/
…		…
1358	*/	1376	*/
1359	if (!(flag & INS_ON_TOP)	1377	if (!(flag & INS_ON_TOP)
1360	&& ms.flags () & P_BLOCKSVIEW	1378	&& ms.flags () & P_BLOCKSVIEW
1361	&& (op->face && !faces [op->face].visibility))	1379	&& (op->face && !faces [op->face].visibility))
1362	{	1380	{
		1381	object *last;
		1382
1363	for (last = top; last != floor; last = last->below)	1383	for (last = top; last != floor; last = last->below)
1364	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1384	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1365	break;	1385	break;
1366		1386
1367	/* Check to see if we found the object that blocks view,	1387	/* Check to see if we found the object that blocks view,
…		…
1375	} /* If objects on this space */	1395	} /* If objects on this space */
1376		1396
1377	if (flag & INS_ABOVE_FLOOR_ONLY)	1397	if (flag & INS_ABOVE_FLOOR_ONLY)
1378	top = floor;	1398	top = floor;
1379		1399
1380	/* Top is the object that our object (op) is going to get inserted above.	1400	// insert object above top, or bottom-most if top = 0
1381	*/
1382
1383	/* First object on this space */
1384	if (!top)	1401	if (!top)
1385	{	1402	{
		1403	op->below = 0;
1386	op->above = ms.bot;	1404	op->above = ms.bot;
1387
1388	if (op->above)
1389	op->above->below = op;
1390
1391	op->below = 0;
1392	ms.bot = op;	1405	ms.bot = op;
		1406
		1407	*(op->above ? &op->above->below : &ms.top) = op;
1393	}	1408	}
1394	else	1409	else
1395	{ /* get inserted into the stack above top */	1410	{
1396	op->above = top->above;	1411	op->above = top->above;
1397
1398	if (op->above)
1399	op->above->below = op;	1412	top->above = op;
1400		1413
1401	op->below = top;	1414	op->below = top;
1402	top->above = op;	1415	*(op->above ? &op->above->below : &ms.top) = op;
1403	}	1416	}
1404		1417	}
1405	if (!op->above)
1406	ms.top = op;
1407	} /* else not INS_BELOW_ORIGINATOR */
1408		1418
1409	if (op->type == PLAYER)	1419	if (op->type == PLAYER)
1410	{	1420	{
1411	op->contr->do_los = 1;	1421	op->contr->do_los = 1;
1412	++op->map->players;	1422	++op->map->players;
…		…
1414	}	1424	}
1415		1425
1416	op->map->dirty = true;	1426	op->map->dirty = true;
1417		1427
1418	if (object *pl = ms.player ())	1428	if (object *pl = ms.player ())
		1429	//TODO: the floorbox prev/next might need updating
		1430	//esrv_send_item (pl, op);
		1431	//TODO: update floorbox to preserve ordering
		1432	if (pl->contr->ns)
1419	pl->contr->ns->floorbox_update ();	1433	pl->contr->ns->floorbox_update ();
1420		1434
1421	/* If this object glows, it may affect lighting conditions that are	1435	/* If this object glows, it may affect lighting conditions that are
1422	* visible to others on this map. But update_all_los is really	1436	* visible to others on this map. But update_all_los is really
1423	* an inefficient way to do this, as it means los for all players	1437	* an inefficient way to do this, as it means los for all players
1424	* on the map will get recalculated. The players could very well	1438	* on the map will get recalculated. The players could very well
…		…
1466	* op is the object to insert it under: supplies x and the map.	1480	* op is the object to insert it under: supplies x and the map.
1467	*/	1481	*/
1468	void	1482	void
1469	replace_insert_ob_in_map (const char *arch_string, object *op)	1483	replace_insert_ob_in_map (const char *arch_string, object *op)
1470	{	1484	{
1471	object *tmp, *tmp1;
1472
1473	/* first search for itself and remove any old instances */	1485	/* first search for itself and remove any old instances */
1474		1486
1475	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1487	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1476	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1488	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1477	tmp->destroy ();	1489	tmp->destroy (1);
1478		1490
1479	tmp1 = arch_to_object (archetype::find (arch_string));	1491	object *tmp = arch_to_object (archetype::find (arch_string));
1480		1492
1481	tmp1->x = op->x;	1493	tmp->x = op->x;
1482	tmp1->y = op->y;	1494	tmp->y = op->y;
		1495
1483	insert_ob_in_map (tmp1, op->map, op, 0);	1496	insert_ob_in_map (tmp, op->map, op, 0);
1484	}	1497	}
1485		1498
1486	object *	1499	object *
1487	object::insert_at (object *where, object *originator, int flags)	1500	object::insert_at (object *where, object *originator, int flags)
1488	{	1501	{
		1502	if (where->env)
		1503	return where->env->insert (this);
		1504	else
1489	return where->map->insert (this, where->x, where->y, originator, flags);	1505	return where->map->insert (this, where->x, where->y, originator, flags);
1490	}	1506	}
1491		1507
1492	/*	1508	/*
1493	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1494	* is returned contains nr objects, and the remaining parts contains
1495	* the rest (or is removed and freed if that number is 0).
1496	* On failure, NULL is returned, and the reason put into the
1497	* global static errmsg array.
1498	*/
1499	object *
1500	get_split_ob (object *orig_ob, uint32 nr)
1501	{
1502	object *newob;
1503	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1504
1505	if (orig_ob->nrof < nr)
1506	{
1507	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1508	return NULL;
1509	}
1510
1511	newob = object_create_clone (orig_ob);
1512
1513	if ((orig_ob->nrof -= nr) < 1)
1514	orig_ob->destroy (1);
1515	else if (!is_removed)
1516	{
1517	if (orig_ob->env != NULL)
1518	sub_weight (orig_ob->env, orig_ob->weight * nr);
1519	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1520	{
1521	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1522	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1523	return NULL;
1524	}
1525	}
1526
1527	newob->nrof = nr;
1528
1529	return newob;
1530	}
1531
1532	/*
1533	* decrease_ob_nr(object, number) decreases a specified number from	1509	* decrease(object, number) decreases a specified number from
1534	* the amount of an object. If the amount reaches 0, the object	1510	* the amount of an object. If the amount reaches 0, the object
1535	* is subsequently removed and freed.	1511	* is subsequently removed and freed.
1536	*	1512	*
1537	* Return value: 'op' if something is left, NULL if the amount reached 0	1513	* Return value: 'op' if something is left, NULL if the amount reached 0
1538	*/	1514	*/
		1515	bool
		1516	object::decrease (sint32 nr)
		1517	{
		1518	if (!nr)
		1519	return true;
		1520
		1521	nr = min (nr, nrof);
		1522
		1523	nrof -= nr;
		1524
		1525	if (nrof)
		1526	{
		1527	adjust_weight (env, -weight * nr); // carrying == 0
		1528
		1529	if (object *pl = visible_to ())
		1530	esrv_update_item (UPD_NROF, pl, this);
		1531
		1532	return true;
		1533	}
		1534	else
		1535	{
		1536	destroy (1);
		1537	return false;
		1538	}
		1539	}
		1540
		1541	/*
		1542	* split(ob,nr) splits up ob into two parts. The part which
		1543	* is returned contains nr objects, and the remaining parts contains
		1544	* the rest (or is removed and returned if that number is 0).
		1545	* On failure, NULL is returned.
		1546	*/
1539	object *	1547	object *
1540	decrease_ob_nr (object *op, uint32 i)	1548	object::split (sint32 nr)
1541	{	1549	{
1542	object *tmp;	1550	int have = number_of ();
1543		1551
1544	if (i == 0) /* objects with op->nrof require this check */	1552	if (have < nr)
1545	return op;	1553	return 0;
1546		1554	else if (have == nr)
1547	if (i > op->nrof)
1548	i = op->nrof;
1549
1550	if (QUERY_FLAG (op, FLAG_REMOVED))
1551	op->nrof -= i;
1552	else if (op->env)
1553	{	1555	{
1554	/* is this object in the players inventory, or sub container
1555	* therein?
1556	*/
1557	tmp = op->in_player ();
1558	/* nope. Is this a container the player has opened?
1559	* If so, set tmp to that player.
1560	* IMO, searching through all the players will mostly
1561	* likely be quicker than following op->env to the map,
1562	* and then searching the map for a player.
1563	*/
1564	if (!tmp)
1565	for_all_players (pl)
1566	if (pl->ob->container == op->env)
1567	{
1568	tmp = pl->ob;
1569	break;
1570	}
1571
1572	if (i < op->nrof)
1573	{
1574	sub_weight (op->env, op->weight * i);
1575	op->nrof -= i;
1576	if (tmp)
1577	esrv_send_item (tmp, op);
1578	}
1579	else
1580	{
1581	op->remove ();	1556	remove ();
1582	op->nrof = 0;	1557	return this;
1583	if (tmp)
1584	esrv_del_item (tmp->contr, op->count);
1585	}
1586	}	1558	}
1587	else	1559	else
1588	{	1560	{
1589	object *above = op->above;	1561	decrease (nr);
1590		1562
1591	if (i < op->nrof)	1563	object *op = deep_clone ();
1592	op->nrof -= i;	1564	op->nrof = nr;
1593	else
1594	{
1595	op->remove ();
1596	op->nrof = 0;
1597	}
1598
1599	/* Since we just removed op, op->above is null */
1600	for (tmp = above; tmp; tmp = tmp->above)
1601	if (tmp->type == PLAYER)
1602	{
1603	if (op->nrof)
1604	esrv_send_item (tmp, op);
1605	else
1606	esrv_del_item (tmp->contr, op->count);
1607	}
1608	}
1609
1610	if (op->nrof)
1611	return op;	1565	return op;
1612	else
1613	{
1614	op->destroy ();
1615	return 0;
1616	}
1617	}
1618
1619	/*
1620	* add_weight(object, weight) adds the specified weight to an object,
1621	* and also updates how much the environment(s) is/are carrying.
1622	*/
1623	void
1624	add_weight (object *op, signed long weight)
1625	{
1626	while (op != NULL)
1627	{
1628	if (op->type == CONTAINER)
1629	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1630
1631	op->carrying += weight;
1632	op = op->env;
1633	}	1566	}
1634	}	1567	}
1635		1568
1636	object *	1569	object *
1637	insert_ob_in_ob (object *op, object *where)	1570	insert_ob_in_ob (object *op, object *where)
…		…
1662	* be != op, if items are merged. -Tero	1595	* be != op, if items are merged. -Tero
1663	*/	1596	*/
1664	object *	1597	object *
1665	object::insert (object *op)	1598	object::insert (object *op)
1666	{	1599	{
1667	if (!QUERY_FLAG (op, FLAG_REMOVED))
1668	op->remove ();
1669
1670	if (op->more)	1600	if (op->more)
1671	{	1601	{
1672	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1602	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1673	return op;	1603	return op;
1674	}	1604	}
1675		1605
1676	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1606	op->remove ();
1677	CLEAR_FLAG (op, FLAG_REMOVED);	1607
		1608	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1678		1609
1679	if (op->nrof)	1610	if (op->nrof)
1680	{
1681	for (object *tmp = inv; tmp; tmp = tmp->below)	1611	for (object *tmp = inv; tmp; tmp = tmp->below)
1682	if (object::can_merge (tmp, op))	1612	if (object::can_merge (tmp, op))
1683	{	1613	{
1684	/* return the original object and remove inserted object	1614	/* return the original object and remove inserted object
1685	(client needs the original object) */	1615	(client needs the original object) */
1686	tmp->nrof += op->nrof;	1616	tmp->nrof += op->nrof;
1687	/* Weight handling gets pretty funky. Since we are adding to	1617
1688	* tmp->nrof, we need to increase the weight.	1618	if (object *pl = tmp->visible_to ())
1689	*/	1619	esrv_update_item (UPD_NROF, pl, tmp);
		1620
1690	add_weight (this, op->weight * op->nrof);	1621	adjust_weight (this, op->total_weight ());
1691	SET_FLAG (op, FLAG_REMOVED);	1622
1692	op->destroy (); /* free the inserted object */	1623	op->destroy (1);
1693	op = tmp;	1624	op = tmp;
1694	op->remove (); /* and fix old object's links */	1625	goto inserted;
1695	CLEAR_FLAG (op, FLAG_REMOVED);
1696	break;
1697	}	1626	}
1698		1627
1699	/* I assume combined objects have no inventory
1700	* We add the weight - this object could have just been removed
1701	* (if it was possible to merge). calling remove_ob will subtract
1702	* the weight, so we need to add it in again, since we actually do
1703	* the linking below
1704	*/
1705	add_weight (this, op->weight * op->nrof);
1706	}
1707	else
1708	add_weight (this, (op->weight + op->carrying));
1709
1710	if (object *otmp = this->in_player ())
1711	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1712	otmp->update_stats ();
1713
1714	op->owner = 0; // its his/hers now. period.	1628	op->owner = 0; // it's his/hers now. period.
1715	op->map = 0;	1629	op->map = 0;
		1630	op->x = 0;
		1631	op->y = 0;
		1632
		1633	op->above = 0;
		1634	op->below = inv;
1716	op->env = this;	1635	op->env = this;
1717	op->above = 0;
1718	op->below = 0;
1719	op->x = op->y = 0;
1720		1636
		1637	if (inv)
		1638	inv->above = op;
		1639
		1640	inv = op;
		1641
		1642	op->flag [FLAG_REMOVED] = 0;
		1643
		1644	if (object *pl = op->visible_to ())
		1645	esrv_send_item (pl, op);
		1646
		1647	adjust_weight (this, op->total_weight ());
		1648
		1649	inserted:
1721	/* reset the light list and los of the players on the map */	1650	/* reset the light list and los of the players on the map */
1722	if (op->glow_radius && map)	1651	if (op->glow_radius && map && map->darkness)
1723	{
1724	#ifdef DEBUG_LIGHTS
1725	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1726	#endif /* DEBUG_LIGHTS */
1727	if (map->darkness)
1728	update_all_los (map, x, y);	1652	update_all_los (map, x, y);
1729	}
1730		1653
1731	/* Client has no idea of ordering so lets not bother ordering it here.	1654	// if this is a player's inventory, update stats
1732	* It sure simplifies this function...	1655	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1733	*/	1656	update_stats ();
1734	if (!inv)
1735	inv = op;
1736	else
1737	{
1738	op->below = inv;
1739	op->below->above = op;
1740	inv = op;
1741	}
1742		1657
1743	INVOKE_OBJECT (INSERT, this);	1658	INVOKE_OBJECT (INSERT, this);
1744		1659
1745	return op;	1660	return op;
1746	}	1661	}
…		…
1874	LOG (llevError, "Present_arch called outside map.\n");	1789	LOG (llevError, "Present_arch called outside map.\n");
1875	return NULL;	1790	return NULL;
1876	}	1791	}
1877		1792
1878	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1793	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1879	if (tmp->arch == at)	1794	if (tmp->arch->archname == at->archname)
1880	return tmp;	1795	return tmp;
1881		1796
1882	return NULL;	1797	return NULL;
1883	}	1798	}
1884		1799
…		…
1948	* The first matching object is returned, or NULL if none.	1863	* The first matching object is returned, or NULL if none.
1949	*/	1864	*/
1950	object *	1865	object *
1951	present_arch_in_ob (const archetype *at, const object *op)	1866	present_arch_in_ob (const archetype *at, const object *op)
1952	{	1867	{
1953	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1868	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1954	if (tmp->arch == at)	1869	if (tmp->arch->archname == at->archname)
1955	return tmp;	1870	return tmp;
1956		1871
1957	return NULL;	1872	return NULL;
1958	}	1873	}
1959		1874
…		…
2368		2283
2369	/*	2284	/*
2370	* create clone from object to another	2285	* create clone from object to another
2371	*/	2286	*/
2372	object *	2287	object *
2373	object_create_clone (object *asrc)	2288	object::deep_clone ()
2374	{	2289	{
2375	object *dst = 0, *tmp, *src, *prev, *item;	2290	assert (("deep_clone called on non-head object", is_head ()));
2376		2291
2377	if (!asrc)	2292	object *dst = clone ();
2378	return 0;
2379		2293
2380	src = asrc->head_ ();	2294	object *prev = dst;
2381
2382	prev = 0;
2383	for (object *part = src; part; part = part->more)	2295	for (object *part = this->more; part; part = part->more)
2384	{	2296	{
2385	tmp = part->clone ();	2297	object *tmp = part->clone ();
2386	tmp->x -= src->x;
2387	tmp->y -= src->y;
2388
2389	if (!part->head)
2390	{
2391	dst = tmp;
2392	tmp->head = 0;
2393	}
2394	else
2395	tmp->head = dst;	2298	tmp->head = dst;
2396
2397	tmp->more = 0;
2398
2399	if (prev)
2400	prev->more = tmp;	2299	prev->more = tmp;
2401
2402	prev = tmp;	2300	prev = tmp;
2403	}	2301	}
2404		2302
2405	for (item = src->inv; item; item = item->below)	2303	for (object *item = inv; item; item = item->below)
2406	insert_ob_in_ob (object_create_clone (item), dst);	2304	insert_ob_in_ob (item->deep_clone (), dst);
2407		2305
2408	return dst;	2306	return dst;
2409	}	2307	}
2410		2308
2411	/* This returns the first object in who's inventory that	2309	/* This returns the first object in who's inventory that
…		…
2420	return tmp;	2318	return tmp;
2421		2319
2422	return 0;	2320	return 0;
2423	}	2321	}
2424		2322
2425	/* If ob has a field named key, return the link from the list,	2323	const shstr &
2426	* otherwise return NULL.	2324	object::kv_get (const shstr &key) const
2427	*
2428	* key must be a passed in shared string - otherwise, this won't
2429	* do the desired thing.
2430	*/
2431	key_value *
2432	get_ob_key_link (const object *ob, const char *key)
2433	{	2325	{
2434	for (key_value *link = ob->key_values; link; link = link->next)	2326	for (key_value *kv = key_values; kv; kv = kv->next)
2435	if (link->key == key)	2327	if (kv->key == key)
2436	return link;
2437
2438	return 0;
2439	}
2440
2441	/*
2442	* Returns the value of op has an extra_field for key, or NULL.
2443	*
2444	* The argument doesn't need to be a shared string.
2445	*
2446	* The returned string is shared.
2447	*/
2448	const char *
2449	get_ob_key_value (const object *op, const char *const key)
2450	{
2451	key_value *link;
2452	shstr_cmp canonical_key (key);
2453
2454	if (!canonical_key)
2455	{
2456	/* 1. There being a field named key on any object
2457	* implies there'd be a shared string to find.
2458	* 2. Since there isn't, no object has this field.
2459	* 3. Therefore, *this* object doesn't have this field.
2460	*/
2461	return 0;
2462	}
2463
2464	/* This is copied from get_ob_key_link() above -
2465	* only 4 lines, and saves the function call overhead.
2466	*/
2467	for (link = op->key_values; link; link = link->next)
2468	if (link->key == canonical_key)
2469	return link->value;	2328	return kv->value;
2470		2329
2471	return 0;	2330	return shstr_null;
2472	}	2331	}
2473		2332
2474	/*	2333	void
2475	* Updates the canonical_key in op to value.	2334	object::kv_set (const shstr &key, const shstr &value)
2476	*
2477	* canonical_key is a shared string (value doesn't have to be).
2478	*
2479	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2480	* keys.
2481	*
2482	* Returns TRUE on success.
2483	*/
2484	int
2485	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2486	{	2335	{
2487	key_value *field = NULL, *last = NULL;	2336	for (key_value *kv = key_values; kv; kv = kv->next)
2488		2337	if (kv->key == key)
2489	for (field = op->key_values; field != NULL; field = field->next)
2490	{
2491	if (field->key != canonical_key)
2492	{	2338	{
2493	last = field;	2339	kv->value = value;
2494	continue;	2340	return;
2495	}	2341	}
2496		2342
2497	if (value)	2343	key_value *kv = new key_value;
2498	field->value = value;	2344
2499	else	2345	kv->next = key_values;
		2346	kv->key = key;
		2347	kv->value = value;
		2348
		2349	key_values = kv;
		2350	}
		2351
		2352	void
		2353	object::kv_del (const shstr &key)
		2354	{
		2355	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2356	if ((*kvp)->key == key)
2500	{	2357	{
2501	/* Basically, if the archetype has this key set,	2358	key_value *kv = *kvp;
2502	* we need to store the null value so when we save	2359	*kvp = (*kvp)->next;
2503	* it, we save the empty value so that when we load,	2360	delete kv;
2504	* we get this value back again.	2361	return;
2505	*/
2506	if (get_ob_key_link (op->arch, canonical_key))
2507	field->value = 0;
2508	else
2509	{
2510	if (last)
2511	last->next = field->next;
2512	else
2513	op->key_values = field->next;
2514
2515	delete field;
2516	}
2517	}	2362	}
2518	return TRUE;
2519	}
2520	/* IF we get here, key doesn't exist */
2521
2522	/* No field, we'll have to add it. */
2523
2524	if (!add_key)
2525	return FALSE;
2526
2527	/* There isn't any good reason to store a null
2528	* value in the key/value list. If the archetype has
2529	* this key, then we should also have it, so shouldn't
2530	* be here. If user wants to store empty strings,
2531	* should pass in ""
2532	*/
2533	if (value == NULL)
2534	return TRUE;
2535
2536	field = new key_value;
2537
2538	field->key = canonical_key;
2539	field->value = value;
2540	/* Usual prepend-addition. */
2541	field->next = op->key_values;
2542	op->key_values = field;
2543
2544	return TRUE;
2545	}
2546
2547	/*
2548	* Updates the key in op to value.
2549	*
2550	* If add_key is FALSE, this will only update existing keys,
2551	* and not add new ones.
2552	* In general, should be little reason FALSE is ever passed in for add_key
2553	*
2554	* Returns TRUE on success.
2555	*/
2556	int
2557	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2558	{
2559	shstr key_ (key);
2560
2561	return set_ob_key_value_s (op, key_, value, add_key);
2562	}	2363	}
2563		2364
2564	object::depth_iterator::depth_iterator (object *container)	2365	object::depth_iterator::depth_iterator (object *container)
2565	: iterator_base (container)	2366	: iterator_base (container)
2566	{	2367	{
…		…
2624	&name,	2425	&name,
2625	title ? "\",title:\"" : "",	2426	title ? "\",title:\"" : "",
2626	title ? (const char *)title : "",	2427	title ? (const char *)title : "",
2627	flag_desc (flagdesc, 512), type);	2428	flag_desc (flagdesc, 512), type);
2628		2429
2629	if (!this->flag[FLAG_REMOVED] && env)	2430	if (!flag[FLAG_REMOVED] && env)
2630	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2431	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2631		2432
2632	if (map)	2433	if (map)
2633	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2434	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2634		2435
…		…
2664	object::open_container (object *new_container)	2465	object::open_container (object *new_container)
2665	{	2466	{
2666	if (container == new_container)	2467	if (container == new_container)
2667	return;	2468	return;
2668		2469
2669	if (object *old_container = container)	2470	object *old_container = container;
		2471
		2472	if (old_container)
2670	{	2473	{
2671	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2474	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2672	return;	2475	return;
2673		2476
2674	#if 0	2477	#if 0
…		…
2676	if (object *closer = old_container->inv)	2479	if (object *closer = old_container->inv)
2677	if (closer->type == CLOSE_CON)	2480	if (closer->type == CLOSE_CON)
2678	closer->destroy ();	2481	closer->destroy ();
2679	#endif	2482	#endif
2680		2483
		2484	// make sure the container is available
		2485	esrv_send_item (this, old_container);
		2486
2681	old_container->flag [FLAG_APPLIED] = 0;	2487	old_container->flag [FLAG_APPLIED] = false;
2682	container = 0;	2488	container = 0;
2683		2489
		2490	// client needs item update to make it work, client bug requires this to be separate
2684	esrv_update_item (UPD_FLAGS, this, old_container);	2491	esrv_update_item (UPD_FLAGS, this, old_container);
		2492
2685	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2493	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2686	play_sound (sound_find ("chest_close"));	2494	play_sound (sound_find ("chest_close"));
2687	}	2495	}
2688		2496
2689	if (new_container)	2497	if (new_container)
…		…
2702	}	2510	}
2703	#endif	2511	#endif
2704		2512
2705	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2513	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2706		2514
		2515	// make sure the container is available, client bug requires this to be separate
		2516	esrv_send_item (this, new_container);
		2517
2707	new_container->flag [FLAG_APPLIED] = 1;	2518	new_container->flag [FLAG_APPLIED] = true;
2708	container = new_container;	2519	container = new_container;
2709		2520
		2521	// client needs flag change
2710	esrv_update_item (UPD_FLAGS, this, new_container);	2522	esrv_update_item (UPD_FLAGS, this, new_container);
2711	esrv_send_inventory (this, new_container);	2523	esrv_send_inventory (this, new_container);
2712	play_sound (sound_find ("chest_open"));	2524	play_sound (sound_find ("chest_open"));
2713	}	2525	}
		2526	// else if (!old_container->env && contr && contr->ns)
		2527	// contr->ns->floorbox_reset ();
2714	}	2528	}
2715		2529
2716	object *	2530	object *
2717	object::force_find (const shstr name)	2531	object::force_find (const shstr name)
2718	{	2532	{
…		…
2744		2558
2745	insert (force);	2559	insert (force);
2746	}	2560	}
2747		2561
2748	void	2562	void
2749	object::play_sound (faceidx sound) const	2563	object::play_sound (faceidx sound)
2750	{	2564	{
2751	if (!sound)	2565	if (!sound)
2752	return;	2566	return;
2753		2567
2754	if (flag [FLAG_REMOVED])	2568	if (flag [FLAG_REMOVED])

Diff Legend

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