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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.319 by root, Sat Apr 3 02:29:40 2010 UTC vs.
Revision 1.345 by root, Sun May 1 16:58:15 2011 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,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify it under	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the	9	* the terms of the Affero GNU General Public License as published by the
37	uint32_t mapspace::smellcount = 10000;	37	uint32_t mapspace::smellcount = 10000;
38		38
39	objectvec objects;	39	objectvec objects;
40	activevec actives;	40	activevec actives;
41		41
		42	freelist_item *object::freelist;
		43	uint32_t object::object_count;
		44	uint32_t object::free_count;
		45	uint32_t object::create_count;
		46	uint32_t object::destroy_count;
		47
42	//+GPL	48	//+GPL
43		49
44	short freearr_x[SIZEOFFREE] = {	50	short freearr_x[SIZEOFFREE] = {
45	0,	51	0,
46	0, 1, 1, 1, 0, -1, -1, -1,	52	0, 1, 1, 1, 0, -1, -1, -1,
…		…
65	9, 10, 13, 14, 17, 18, 21, 22,	71	9, 10, 13, 14, 17, 18, 21, 22,
66	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,	72	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
67	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	73	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
68	};	74	};
69		75
		76	const char *wall_suffix[16] = {
		77	"0",
		78	"1_3",
		79	"1_4",
		80	"2_1_2",
		81	"1_2",
		82	"2_2_4",
		83	"2_2_1",
		84	"3_1",
		85	"1_1",
		86	"2_2_3",
		87	"2_2_2",
		88	"3_3",
		89	"2_1_1",
		90	"3_4",
		91	"3_2",
		92	"4"
		93	};
		94
70	static void	95	static void
71	write_uuid (uval64 skip, bool sync)	96	write_uuid (uval64 skip, bool sync)
72	{	97	{
73	CALL_BEGIN (2);	98	CALL_BEGIN (2);
74	CALL_ARG_SV (newSVval64 (skip));	99	CALL_ARG_SV (newSVval64 (skip));
…		…
208		233
209	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	234	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
210	static bool	235	static bool
211	compare_ob_value_lists_one (const object wants, const object has)	236	compare_ob_value_lists_one (const object wants, const object has)
212	{	237	{
213	/* n-squared behaviour (see kv_get), but I'm hoping both	238	/* n-squared behaviour (see kv.get), but I'm hoping both
214	* objects with lists are rare, and lists stay short. If not, use a	239	* objects with lists are rare, and lists stay short. If not, use a
215	* different structure or at least keep the lists sorted...	240	* different structure or at least keep the lists sorted...
216	*/	241	*/
217		242
218	/* For each field in wants, */	243	/* For each field in wants, */
219	for (key_value *kv = wants->key_values; kv; kv = kv->next)	244	for (key_value *kv = wants->kv.first; kv; kv = kv->next)
220	if (has->kv_get (kv->key) != kv->value)	245	if (has->kv.get (kv->key) != kv->value)
221	return false;	246	return false;
222		247
223	/* If we get here, every field in wants has a matching field in has. */	248	/* If we get here, every field in wants has a matching field in has. */
224	return true;	249	return true;
225	}	250	}
…		…
249	*/	274	*/
250	bool object::can_merge_slow (object ob1, object ob2)	275	bool object::can_merge_slow (object ob1, object ob2)
251	{	276	{
252	/* A couple quick sanity checks */	277	/* A couple quick sanity checks */
253	if (ob1 == ob2	278	if (ob1 == ob2
254	\|\| ob1->type != ob2->type	279	\|\| ob1->type != ob2->type
255	\|\| ob1->value != ob2->value	280	\|\| ob1->value != ob2->value
256	\|\| ob1->name != ob2->name	281	\|\| ob1->name != ob2->name
		282	\|\| ob1->custom_name != ob2->custom_name
257	\|\| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)	283	\|\| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
258	return 0;	284	return 0;
259		285
260	/* Do not merge objects if nrof would overflow, assume nrof	286	/* Do not merge objects if nrof would overflow, assume nrof
261	* is always 0 .. 2*31-1 /	287	* is always 0 .. 2*31-1 /
…		…
266	* This is to the comparison of the flags below will be OK. We	292	* This is to the comparison of the flags below will be OK. We
267	* just can't ignore the been applied or identified flags, as they	293	* just can't ignore the been applied or identified flags, as they
268	* are not equal - just if it has been identified, the been_applied	294	* are not equal - just if it has been identified, the been_applied
269	* flags lose any meaning.	295	* flags lose any meaning.
270	*/	296	*/
271	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	297	if (ob1->flag [FLAG_IDENTIFIED])
272	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	298	ob1->set_flag (FLAG_BEEN_APPLIED);
273		299
274	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	300	if (ob2->flag [FLAG_IDENTIFIED])
275	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	301	ob2->set_flag (FLAG_BEEN_APPLIED);
276		302
277	if (ob1->arch->archname != ob2->arch->archname	303	if (ob1->arch->archname != ob2->arch->archname
278	\|\| ob1->name != ob2->name	304	\|\| ob1->name != ob2->name
279	\|\| ob1->title != ob2->title	305	\|\| ob1->title != ob2->title
280	\|\| ob1->msg != ob2->msg	306	\|\| ob1->msg != ob2->msg
…		…
329		355
330	/* Don't merge objects that are applied. With the new 'body' code,	356	/* Don't merge objects that are applied. With the new 'body' code,
331	* it is possible for most any character to have more than one of	357	* it is possible for most any character to have more than one of
332	* some items equipped, and we don't want those to merge.	358	* some items equipped, and we don't want those to merge.
333	*/	359	*/
334	if (QUERY_FLAG (ob1, FLAG_APPLIED) \|\| QUERY_FLAG (ob2, FLAG_APPLIED))	360	if (ob1->flag [FLAG_APPLIED] \|\| ob2->flag [FLAG_APPLIED])
335	return 0;	361	return 0;
336		362
337	/* Note sure why the following is the case - either the object has to	363	/* Note sure why the following is the case - either the object has to
338	* be animated or have a very low speed. Is this an attempted monster	364	* be animated or have a very low speed. Is this an attempted monster
339	* check?	365	* check?
340	*/	366	*/
341	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	367	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
342	return 0;	368	return 0;
343		369
344	switch (ob1->type)	370	switch (ob1->type)
345	{	371	{
346	case SCROLL:	372	case SCROLL:
347	if (ob1->level != ob2->level)	373	if (ob1->level != ob2->level)
348	return 0;	374	return 0;
349	break;	375	break;
350	}	376	}
351		377
352	if (ob1->key_values \|\| ob2->key_values)	378	if (!ob1->kv.empty () \|\| !ob2->kv.empty ())
353	{	379	{
354	/* At least one of these has key_values. */	380	/* At least one of these has key_values. */
355	if ((!ob1->key_values) != (!ob2->key_values))	381	if (ob1->kv.empty () != ob2->kv.empty ())
356	return 0; /* One has fields, but the other one doesn't. */	382	return 0; /* One has fields, but the other one doesn't. */
357		383
358	if (!compare_ob_value_lists (ob1, ob2))	384	if (!compare_ob_value_lists (ob1, ob2))
359	return 0;	385	return 0;
360	}	386	}
…		…
420		446
421	return 0;	447	return 0;
422	}	448	}
423		449
424	// adjust weight per container type ("of holding")	450	// adjust weight per container type ("of holding")
425	static sint32	451	static uint32
426	weight_adjust_for (object *op, sint32 weight)	452	weight_adjust_for (object *op, uint32 weight)
427	{	453	{
428	return op->type == CONTAINER	454	return op->type == CONTAINER
429	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	455	? weight - weight * op->stats.Str / 100
430	: weight;	456	: weight;
431	}	457	}
432		458
433	/*	459	/*
434	* adjust_weight(object, weight) adds the specified weight to an object,	460	* subtracts, then adds, the specified weight to an object,
435	* and also updates how much the environment(s) is/are carrying.	461	* and also updates how much the environment(s) is/are carrying.
436	*/	462	*/
437	static void	463	static void
438	adjust_weight (object *op, sint32 weight)	464	adjust_weight (object *op, sint32 sub, sint32 add)
439	{	465	{
440	while (op)	466	while (op)
441	{	467	{
442	// adjust by actual difference to account for rounding errors	468	sint32 ocarrying = op->carrying;
443	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
444	weight = weight_adjust_for (op, op->carrying)
445	- weight_adjust_for (op, op->carrying - weight);
446		469
447	if (!weight)	470	op->carrying -= weight_adjust_for (op, sub);
448	return;	471	op->carrying += weight_adjust_for (op, add);
449
450	op->carrying += weight;
451		472
452	if (object *pl = op->visible_to ())	473	if (object *pl = op->visible_to ())
453	if (pl != op) // player is handled lazily	474	if (pl != op) // player is handled lazily
454	esrv_update_item (UPD_WEIGHT, pl, op);	475	esrv_update_item (UPD_WEIGHT, pl, op);
455		476
		477	sub = ocarrying;
		478	add = op->carrying;
		479
456	op = op->env;	480	op = op->env;
457	}	481	}
458	}	482	}
459		483
460	/*	484	/*
…		…
467	{	491	{
468	sint32 sum = 0;	492	sint32 sum = 0;
469		493
470	for (object *op = inv; op; op = op->below)	494	for (object *op = inv; op; op = op->below)
471	{	495	{
472	if (op->inv)
473	op->update_weight ();	496	op->update_weight ();
474		497
475	sum += op->total_weight ();	498	sum += weight_adjust_for (this, op->total_weight ());
476	}	499	}
477
478	sum = weight_adjust_for (this, sum);
479		500
480	if (sum != carrying)	501	if (sum != carrying)
481	{	502	{
		503	if (carrying != sum && carrying)//D
		504	LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n",
		505	(long long)sum, (long long)carrying, debug_desc ());
		506
482	carrying = sum;	507	carrying = sum;
483		508
484	if (object *pl = visible_to ())	509	if (object *pl = visible_to ())
485	if (pl != this) // player is handled lazily	510	if (pl != this) // player is handled lazily
486	esrv_update_item (UPD_WEIGHT, pl, this);	511	esrv_update_item (UPD_WEIGHT, pl, this);
…		…
572	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());	597	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
573	return;	598	return;
574	}	599	}
575		600
576	this->owner = owner;	601	this->owner = owner;
577	}
578
579	/* Zero the key_values on op, decrementing the shared-string
580	* refcounts and freeing the links.
581	*/
582	static void
583	free_key_values (object *op)
584	{
585	for (key_value *i = op->key_values; i; )
586	{
587	key_value *next = i->next;
588	delete i;
589
590	i = next;
591	}
592
593	op->key_values = 0;
594	}	602	}
595		603
596	/*	604	/*
597	* copy_to first frees everything allocated by the dst object,	605	* copy_to first frees everything allocated by the dst object,
598	* and then copies the contents of itself into the second	606	* and then copies the contents of itself into the second
…		…
604	void	612	void
605	object::copy_to (object *dst)	613	object::copy_to (object *dst)
606	{	614	{
607	dst->remove ();	615	dst->remove ();
608	(object_copy )dst = *this;	616	(object_copy )dst = *this;
		617
		618	// maybe move to object_copy?
		619	dst->kv = kv;
		620
609	dst->flag [FLAG_REMOVED] = true;	621	dst->flag [FLAG_REMOVED] = true;
610
611	/* Copy over key_values, if any. */
612	if (key_values)
613	{
614	key_value *tail = 0;
615	dst->key_values = 0;
616
617	for (key_value *i = key_values; i; i = i->next)
618	{
619	key_value *new_link = new key_value;
620
621	new_link->next = 0;
622	new_link->key = i->key;
623	new_link->value = i->value;
624
625	/* Try and be clever here, too. */
626	if (!dst->key_values)
627	{
628	dst->key_values = new_link;
629	tail = new_link;
630	}
631	else
632	{
633	tail->next = new_link;
634	tail = new_link;
635	}
636	}
637	}
638
639	dst->activate ();	622	dst->activate ();
640	}	623	}
641		624
642	void	625	void
643	object::instantiate ()	626	object::instantiate ()
644	{	627	{
645	if (!uuid.seq) // HACK	628	if (!uuid.seq) // HACK
646	uuid = UUID::gen ();	629	uuid = UUID::gen ();
647		630
648	// TODO: unclean state changes, should nt be done in copy_to AND instantiate	631	// TODO: unclean state changes, should not be done in copy_to AND instantiate
649	if (flag [FLAG_RANDOM_SPEED] && speed)	632	if (flag [FLAG_RANDOM_SPEED] && speed)
650	speed_left = - speed - rndm (); // TODO animation	633	speed_left = - speed - rndm (); // TODO animation
651	else	634	else
652	speed_left = -1.;	635	speed_left = -1.;
653		636
…		…
683	* be called to update the face variable, _and_ how it looks on the map.	666	* be called to update the face variable, _and_ how it looks on the map.
684	*/	667	*/
685	void	668	void
686	update_turn_face (object *op)	669	update_turn_face (object *op)
687	{	670	{
688	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) \|\| !op->arch)	671	if (!op->flag [FLAG_IS_TURNABLE] \|\| !op->arch)
689	return;	672	return;
690		673
691	SET_ANIMATION (op, op->direction);	674	SET_ANIMATION (op, op->direction);
692	update_object (op, UP_OBJ_FACE);	675	update_object (op, UP_OBJ_FACE);
693	}	676	}
…		…
759	/* nop */;	742	/* nop */;
760	else if (action == UP_OBJ_INSERT)	743	else if (action == UP_OBJ_INSERT)
761	{	744	{
762	#if 0	745	#if 0
763	// this is likely overkill, TODO: revisit (schmorp)	746	// this is likely overkill, TODO: revisit (schmorp)
764	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	747	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
765	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	748	\|\| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
766	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))	749	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
767	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	750	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
768	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	751	\|\| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
769	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	752	\|\| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
770	\|\| (m.move_on \| op->move_on ) != m.move_on	753	\|\| (m.move_on \| op->move_on ) != m.move_on
771	\|\| (m.move_off \| op->move_off ) != m.move_off	754	\|\| (m.move_off \| op->move_off ) != m.move_off
772	\|\| (m.move_slow \| op->move_slow) != m.move_slow	755	\|\| (m.move_slow \| op->move_slow) != m.move_slow
773	/* This isn't perfect, but I don't expect a lot of objects to	756	/* This isn't perfect, but I don't expect a lot of objects to
774	* have move_allow right now.	757	* have move_allow right now.
…		…
795	update_object (op->more, action);	778	update_object (op->more, action);
796	}	779	}
797		780
798	object::object ()	781	object::object ()
799	{	782	{
800	SET_FLAG (this, FLAG_REMOVED);	783	this->set_flag (FLAG_REMOVED);
801		784
802	//expmul = 1.0; declared const for the time being	785	//expmul = 1.0; declared const for the time being
803	face = blank_face;	786	face = blank_face;
804	material = MATERIAL_NULL;	787	material = MATERIAL_NULL;
805	}	788	}
806		789
807	object::~object ()	790	object::~object ()
808	{	791	{
809	unlink ();	792	unlink ();
810		793
811	free_key_values (this);	794	kv.clear ();
812	}	795	}
813
814	static int object_count;
815		796
816	void object::link ()	797	void object::link ()
817	{	798	{
818	assert (!index);//D	799	assert (!index);//D
819	uuid = UUID::gen ();	800	uuid = UUID::gen ();
820	count = ++object_count;
821		801
822	refcnt_inc ();	802	refcnt_inc ();
823	objects.insert (this);	803	objects.insert (this);
		804
		805	++create_count;
		806
824	}	807	}
825		808
826	void object::unlink ()	809	void object::unlink ()
827	{	810	{
828	if (!index)	811	if (!index)
829	return;	812	return;
		813
		814	++destroy_count;
830		815
831	objects.erase (this);	816	objects.erase (this);
832	refcnt_dec ();	817	refcnt_dec ();
833	}	818	}
834		819
…		…
939	map->insert (op, x, y);	924	map->insert (op, x, y);
940	}	925	}
941	}	926	}
942	}	927	}
943		928
		929	/*
		930	* Remove and free all objects in the inventory of the given object.
		931	* Unlike destroy_inv, this assumes the *this is destroyed as well
		932	* well, so we can (and have to!) take shortcuts.
		933	*/
		934	void
		935	object::destroy_inv_fast ()
		936	{
		937	while (object *op = inv)
		938	{
		939	// remove from object the fast way
		940	op->flag [FLAG_REMOVED] = true;
		941	op->env = 0;
		942	if ((inv = inv->below))
		943	inv->above = 0;
		944
		945	// then destroy
		946	op->destroy ();
		947	}
		948	}
		949
		950	void
		951	object::freelist_free (int count)
		952	{
		953	while (count-- && freelist)
		954	{
		955	freelist_item *next = freelist->next;
		956	// count is being "destroyed"
		957
		958	sfree ((char *)freelist, sizeof (object));
		959
		960	freelist = next;
		961	--free_count;
		962	}
		963	}
		964
		965	object *
944	object *object::create ()	966	object::create ()
945	{	967	{
946	object *op = new object;	968	object *op;
		969
		970	if (freelist)
		971	{
		972	freelist_item li = *freelist;
		973	memset (freelist, 0, sizeof (object));
		974
		975	op = new (freelist) object;
		976	op->count = li.count;
		977
		978	freelist = li.next;
		979	--free_count;
		980	}
		981	else
		982	{
		983	void *ni = salloc0<char> (sizeof (object));
		984
		985	op = new(ni) object;
		986
		987	op->count = ++object_count;
		988	}
		989
947	op->link ();	990	op->link ();
		991
948	return op;	992	return op;
949	}	993	}
950		994
		995	void
		996	object::do_delete ()
		997	{
		998	uint32_t count = this->count;
		999
		1000	this->~object ();
		1001
		1002	freelist_item li = (freelist_item )this;
		1003	li->next = freelist;
		1004	li->count = count;
		1005
		1006	freelist = li;
		1007	++free_count;
		1008	}
		1009
951	static struct freed_map : maptile	1010	static struct freed_map : maptile
952	{	1011	{
953	freed_map ()	1012	freed_map ()
		1013	: maptile (3, 3)
954	{	1014	{
955	path = "<freed objects map>";	1015	path = "<freed objects map>";
956	name = "/internal/freed_objects_map";	1016	name = "/internal/freed_objects_map";
957	width = 3;
958	height = 3;
959	no_drop = 1;	1017	no_drop = 1;
960	no_reset = 1;	1018	no_reset = 1;
961		1019
962	alloc ();
963	in_memory = MAP_ACTIVE;	1020	in_memory = MAP_ACTIVE;
964	}	1021	}
965		1022
966	~freed_map ()	1023	~freed_map ()
967	{	1024	{
…		…
1018	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1075	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1019	head->destroy ();	1076	head->destroy ();
1020	return;	1077	return;
1021	}	1078	}
1022		1079
1023	destroy_inv (false);	1080	destroy_inv_fast ();
1024		1081
1025	if (is_head ())	1082	if (is_head ())
1026	if (sound_destroy)	1083	if (sound_destroy)
1027	play_sound (sound_destroy);	1084	play_sound (sound_destroy);
1028	else if (flag [FLAG_MONSTER])	1085	else if (flag [FLAG_MONSTER])
…		…
1060	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed	1117	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1061	if (object *pl = visible_to ())	1118	if (object *pl = visible_to ())
1062	esrv_del_item (pl->contr, count);	1119	esrv_del_item (pl->contr, count);
1063	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1120	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1064		1121
1065	adjust_weight (env, -total_weight ());	1122	adjust_weight (env, total_weight (), 0);
1066		1123
1067	object *pl = in_player ();	1124	object *pl = in_player ();
1068		1125
1069	/* we set up values so that it could be inserted into	1126	/* we set up values so that it could be inserted into
1070	* the map, but we don't actually do that - it is up	1127	* the map, but we don't actually do that - it is up
…		…
1084		1141
1085	if (pl && pl->is_player ())	1142	if (pl && pl->is_player ())
1086	{	1143	{
1087	if (expect_false (pl->contr->combat_ob == this))	1144	if (expect_false (pl->contr->combat_ob == this))
1088	{	1145	{
1089	pl->apply (pl->contr->combat_ob, AP_UNAPPLY);	1146	pl->apply (pl->contr->combat_ob, AP_UNAPPLY \| AP_IGNORE_CURSE);
1090	pl->contr->combat_ob = 0;	1147	pl->contr->combat_ob = 0;
1091	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);	1148	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
1092	}	1149	}
1093		1150
1094	if (expect_false (pl->contr->ranged_ob == this))	1151	if (expect_false (pl->contr->ranged_ob == this))
1095	{	1152	{
1096	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);	1153	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY \| AP_IGNORE_CURSE);
1097	pl->contr->ranged_ob = 0;	1154	pl->contr->ranged_ob = 0;
1098	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);	1155	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
1099	}	1156	}
1100		1157
1101	pl->contr->queue_stats_update ();	1158	pl->contr->queue_stats_update ();
…		…
1128	else if (pl->container_ () == this)	1185	else if (pl->container_ () == this)
1129	{	1186	{
1130	// removing a container should close it	1187	// removing a container should close it
1131	close_container ();	1188	close_container ();
1132	}	1189	}
1133		1190	else
1134	esrv_del_item (pl->contr, count);	1191	esrv_del_item (pl->contr, count);
1135	}	1192	}
1136		1193
1137	/* link the object above us */	1194	/* link the object above us */
1138	// re-link, make sure compiler can easily use cmove	1195	// re-link, make sure compiler can easily use cmove
1139	*(above ? &above->below : &ms.top) = below;	1196	*(above ? &above->below : &ms.top) = below;
…		…
1288	{	1345	{
1289	op->remove ();	1346	op->remove ();
1290		1347
1291	if (m == &freed_map)//D TODO: remove soon	1348	if (m == &freed_map)//D TODO: remove soon
1292	{//D	1349	{//D
1293	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D	1350	LOG (llevError \| logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D
1294	}//D	1351	}//D
1295		1352
1296	/* Ideally, the caller figures this out. However, it complicates a lot	1353	/* Ideally, the caller figures this out. However, it complicates a lot
1297	* of areas of callers (eg, anything that uses find_free_spot would now	1354	* of areas of callers (eg, anything that uses find_free_spot would now
1298	* need extra work	1355	* need extra work
…		…
1325	// from here :/	1382	// from here :/
1326	op->nrof += tmp->nrof;	1383	op->nrof += tmp->nrof;
1327	tmp->destroy ();	1384	tmp->destroy ();
1328	}	1385	}
1329		1386
1330	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1387	op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1331	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1388	op->clr_flag (FLAG_INV_LOCKED);
1332		1389
1333	if (!QUERY_FLAG (op, FLAG_ALIVE))	1390	if (!op->flag [FLAG_ALIVE])
1334	CLEAR_FLAG (op, FLAG_NO_STEAL);	1391	op->clr_flag (FLAG_NO_STEAL);
1335		1392
1336	if (flag & INS_BELOW_ORIGINATOR)	1393	if (flag & INS_BELOW_ORIGINATOR)
1337	{	1394	{
1338	if (originator->map != op->map \|\| originator->x != op->x \|\| originator->y != op->y)	1395	if (originator->map != op->map \|\| originator->x != op->x \|\| originator->y != op->y)
1339	{	1396	{
…		…
1374	* when lots of spells are cast in one area. Currently, it is presumed	1431	* when lots of spells are cast in one area. Currently, it is presumed
1375	* that flying non pickable objects are spell objects.	1432	* that flying non pickable objects are spell objects.
1376	*/	1433	*/
1377	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1434	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1378	{	1435	{
1379	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) \|\| QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))	1436	if (tmp->flag [FLAG_IS_FLOOR] \|\| tmp->flag [FLAG_OVERLAY_FLOOR])
1380	floor = tmp;	1437	floor = tmp;
1381		1438
1382	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1439	if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1383	{	1440	{
1384	/* We insert above top, so we want this object below this */	1441	/* We insert above top, so we want this object below this */
1385	top = tmp->below;	1442	top = tmp->below;
1386	break;	1443	break;
1387	}	1444	}
…		…
1405	&& (op->face && !faces [op->face].visibility))	1462	&& (op->face && !faces [op->face].visibility))
1406	{	1463	{
1407	object *last;	1464	object *last;
1408		1465
1409	for (last = top; last != floor; last = last->below)	1466	for (last = top; last != floor; last = last->below)
1410	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1467	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1411	break;	1468	break;
1412		1469
1413	/* Check to see if we found the object that blocks view,	1470	/* Check to see if we found the object that blocks view,
1414	* and make sure we have a below pointer for it so that	1471	* and make sure we have a below pointer for it so that
1415	* we can get inserted below this one, which requires we	1472	* we can get inserted below this one, which requires we
…		…
1488	*/	1545	*/
1489		1546
1490	/* if this is not the head or flag has been passed, don't check walk on status */	1547	/* if this is not the head or flag has been passed, don't check walk on status */
1491	if (!(flag & INS_NO_WALK_ON) && op->is_head ())	1548	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1492	{	1549	{
1493	if (check_move_on (op, originator))	1550	if (check_move_on (op, originator, flag))
1494	return 0;	1551	return 0;
1495		1552
1496	/* If we are a multi part object, lets work our way through the check	1553	/* If we are a multi part object, let's work our way through the check
1497	* walk on's.	1554	* walk on's.
1498	*/	1555	*/
1499	for (object *tmp = op->more; tmp; tmp = tmp->more)	1556	for (object *tmp = op->more; tmp; tmp = tmp->more)
1500	if (check_move_on (tmp, originator))	1557	if (check_move_on (tmp, originator, flag))
1501	return 0;	1558	return 0;
1502	}	1559	}
1503		1560
1504	return op;	1561	return op;
1505	}	1562	}
…		…
1546	\|\| (items < m->max_items	1603	\|\| (items < m->max_items
1547	&& ms.volume () < m->max_volume))	1604	&& ms.volume () < m->max_volume))
1548	return true;	1605	return true;
1549		1606
1550	if (originator && originator->is_player ())	1607	if (originator && originator->is_player ())
1551	originator->contr->failmsg (format (	1608	originator->contr->failmsgf (
1552	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",	1609	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1553	query_name ()	1610	query_name ()
1554	));	1611	);
1555		1612
1556	return false;	1613	return false;
1557	}	1614	}
1558		1615
1559	/*	1616	/*
…		…
1571		1628
1572	nr = min (nr, nrof);	1629	nr = min (nr, nrof);
1573		1630
1574	if (nrof > nr)	1631	if (nrof > nr)
1575	{	1632	{
		1633	sint64 oweight = total_weight ();
		1634
1576	nrof -= nr;	1635	nrof -= nr;
1577	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1578		1636
1579	if (object *pl = visible_to ())	1637	if (object *pl = visible_to ())
1580	esrv_update_item (UPD_NROF, pl, this);	1638	esrv_update_item (UPD_NROF, pl, this);
		1639
		1640	adjust_weight (env, oweight, total_weight ());
1581		1641
1582	return true;	1642	return true;
1583	}	1643	}
1584	else	1644	else
1585	{	1645	{
…		…
1660	if (op->nrof)	1720	if (op->nrof)
1661	for (object *tmp = inv; tmp; tmp = tmp->below)	1721	for (object *tmp = inv; tmp; tmp = tmp->below)
1662	if (object::can_merge (tmp, op))	1722	if (object::can_merge (tmp, op))
1663	{	1723	{
1664	/* return the original object and remove inserted object	1724	/* return the original object and remove inserted object
1665	(client needs the original object) */	1725	(client prefers the original object) */
		1726
		1727	// carring must be 0 for mergable objects
		1728	sint64 oweight = tmp->weight * tmp->nrof;
		1729
1666	tmp->nrof += op->nrof;	1730	tmp->nrof += op->nrof;
1667		1731
1668	if (object *pl = tmp->visible_to ())	1732	if (object *pl = tmp->visible_to ())
1669	esrv_update_item (UPD_NROF, pl, tmp);	1733	esrv_update_item (UPD_NROF, pl, tmp);
1670		1734
1671	adjust_weight (this, op->total_weight ());	1735	adjust_weight (this, oweight, tmp->weight * tmp->nrof);
1672		1736
1673	op->destroy ();	1737	op->destroy ();
1674	op = tmp;	1738	op = tmp;
1675	goto inserted;	1739	goto inserted;
1676	}	1740	}
…		…
1692	op->flag [FLAG_REMOVED] = 0;	1756	op->flag [FLAG_REMOVED] = 0;
1693		1757
1694	if (object *pl = op->visible_to ())	1758	if (object *pl = op->visible_to ())
1695	esrv_send_item (pl, op);	1759	esrv_send_item (pl, op);
1696		1760
1697	adjust_weight (this, op->total_weight ());	1761	adjust_weight (this, 0, op->total_weight ());
1698		1762
1699	inserted:	1763	inserted:
1700	/* reset the light list and los of the players on the map */	1764	/* reset the light list and los of the players on the map */
1701	if (op->glow_radius && is_on_map ())	1765	if (op->glow_radius && is_on_map ())
1702	{	1766	{
…		…
1731	* MSW 2001-07-08: Check all objects on space, not just those below	1795	* MSW 2001-07-08: Check all objects on space, not just those below
1732	* object being inserted. insert_ob_in_map may not put new objects	1796	* object being inserted. insert_ob_in_map may not put new objects
1733	* on top.	1797	* on top.
1734	*/	1798	*/
1735	int	1799	int
1736	check_move_on (object op, object originator)	1800	check_move_on (object op, object originator, int flags)
1737	{	1801	{
1738	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1802	if (op->flag [FLAG_NO_APPLY])
1739	return 0;	1803	return 0;
1740		1804
1741	object *tmp;	1805	object *tmp;
1742	maptile *m = op->map;	1806	maptile *m = op->map;
1743	int x = op->x, y = op->y;	1807	int x = op->x, y = op->y;
…		…
1780	* Second check makes sure that the movement types not being slowed	1844	* Second check makes sure that the movement types not being slowed
1781	* (~slow_move) is not blocked on this space - just because the	1845	* (~slow_move) is not blocked on this space - just because the
1782	* space doesn't slow down swimming (for example), if you can't actually	1846	* space doesn't slow down swimming (for example), if you can't actually
1783	* swim on that space, can't use it to avoid the penalty.	1847	* swim on that space, can't use it to avoid the penalty.
1784	*/	1848	*/
1785	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1849	if (!op->flag [FLAG_WIZPASS])
1786	{	1850	{
1787	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1851	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1788	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1852	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1789	{	1853	{
1790	float diff = tmp->move_slow_penalty * fabs (op->speed);	1854	float diff = tmp->move_slow_penalty * fabs (op->speed);
…		…
1800		1864
1801	/* Basically same logic as above, except now for actual apply. */	1865	/* Basically same logic as above, except now for actual apply. */
1802	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|	1866	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|
1803	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1867	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1804	{	1868	{
		1869	if ((flags & INS_NO_AUTO_EXIT)
		1870	&& (tmp->type == EXIT \|\| tmp->type == TELEPORTER
		1871	\|\| tmp->type == HOLE \|\| tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead
		1872	continue;
		1873
1805	move_apply (tmp, op, originator);	1874	move_apply (tmp, op, originator);
1806		1875
1807	if (op->destroyed ())	1876	if (op->destroyed ())
1808	return 1;	1877	return 1;
1809		1878
…		…
1921	void	1990	void
1922	flag_inv (object *op, int flag)	1991	flag_inv (object *op, int flag)
1923	{	1992	{
1924	for (object *tmp = op->inv; tmp; tmp = tmp->below)	1993	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1925	{	1994	{
1926	SET_FLAG (tmp, flag);	1995	tmp->set_flag (flag);
1927	flag_inv (tmp, flag);	1996	flag_inv (tmp, flag);
1928	}	1997	}
1929	}	1998	}
1930		1999
1931	/*	2000	/*
…		…
1934	void	2003	void
1935	unflag_inv (object *op, int flag)	2004	unflag_inv (object *op, int flag)
1936	{	2005	{
1937	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2006	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1938	{	2007	{
1939	CLEAR_FLAG (tmp, flag);	2008	tmp->clr_flag (flag);
1940	unflag_inv (tmp, flag);	2009	unflag_inv (tmp, flag);
1941	}	2010	}
1942	}	2011	}
1943		2012
1944	/*	2013	/*
…		…
2134	{	2203	{
2135	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2204	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2136	}	2205	}
2137		2206
2138	/*	2207	/*
2139	* find_dir_2(delta-x,delta-y) will return a direction in which	2208	* find_dir_2(delta-x,delta-y) will return a direction value
2140	* an object which has subtracted the x and y coordinates of another	2209	* for running into direct [dx, dy].
2141	* object, needs to travel toward it.	2210	* (the opposite of crossfire's find_dir_2!)
2142	*/	2211	*/
2143	int	2212	int
2144	find_dir_2 (int x, int y)	2213	find_dir_2 (int x, int y)
2145	{	2214	{
		2215	#if 1 // new algorithm
		2216	// this works by putting x, y into 16 sectors, which
		2217	// are not equal sized, but are a better approximation
		2218	// then the old algorithm, and then using a mapping
		2219	// table to map it into a direction value.
		2220	// basically, it maps these comparisons to each bit
		2221	// bit #3: x < 0
		2222	// bit #2: y < 0
		2223	// bit #1: x > y
		2224	// bit #0: x > 2y
		2225
		2226	static const uint8 dir[16] = {
		2227	4, 5, 4, 3,
		2228	2, 1, 2, 3,
		2229	6, 5, 6, 7,
		2230	8, 1, 8, 7,
		2231	};
		2232	int sector = 0;
		2233
		2234	// this is a bit ugly, but more likely to result in branchless code
		2235	sector \|= x < 0 ? 8 : 0;
		2236	x = x < 0 ? -x : x; // abs
		2237
		2238	sector \|= y < 0 ? 4 : 0;
		2239	y = y < 0 ? -y : y; // abs
		2240
		2241	if (x > y)
		2242	{
		2243	sector \|= 2;
		2244
		2245	if (x > y * 2)
		2246	sector \|= 1;
		2247	}
		2248	else
		2249	{
		2250	if (y > x * 2)
		2251	sector \|= 1;
		2252	else if (!y)
		2253	return 0; // x == 0 here
		2254	}
		2255
		2256	return dir [sector];
		2257	#else // old algorithm
2146	int q;	2258	int q;
2147		2259
2148	if (y)	2260	if (y)
2149	q = x * 100 / y;	2261	q = 128 * x / y;
2150	else if (x)	2262	else if (x)
2151	q = -300 * x;	2263	q = -512 * x; // to make it > 309
2152	else	2264	else
2153	return 0;	2265	return 0;
2154		2266
2155	if (y > 0)	2267	if (y > 0)
2156	{	2268	{
2157	if (q < -242)	2269	if (q < -309) return 7;
		2270	if (q < -52) return 6;
		2271	if (q < 52) return 5;
		2272	if (q < 309) return 4;
		2273
2158	return 3;	2274	return 3;
2159	if (q < -41)	2275	}
2160	return 2;	2276	else
2161	if (q < 41)	2277	{
2162	return 1;	2278	if (q < -309) return 3;
2163	if (q < 242)	2279	if (q < -52) return 2;
2164	return 8;	2280	if (q < 52) return 1;
		2281	if (q < 309) return 8;
		2282
2165	return 7;	2283	return 7;
2166	}	2284	}
2167		2285	#endif
2168	if (q < -242)
2169	return 7;
2170	if (q < -41)
2171	return 6;
2172	if (q < 41)
2173	return 5;
2174	if (q < 242)
2175	return 4;
2176
2177	return 3;
2178	}	2286	}
2179		2287
2180	/*	2288	/*
2181	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2289	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2182	* between two directions (which are expected to be absolute (see absdir())	2290	* between two directions (which are expected to be absolute (see absdir())
2183	*/	2291	*/
2184	int	2292	int
2185	dirdiff (int dir1, int dir2)	2293	dirdiff (int dir1, int dir2)
2186	{	2294	{
2187	int d;
2188
2189	d = abs (dir1 - dir2);	2295	int d = abs (dir1 - dir2);
2190	if (d > 4)
2191	d = 8 - d;
2192		2296
2193	return d;	2297	return d > 4 ? 8 - d : d;
2194	}	2298	}
2195		2299
2196	/* peterm:	2300	/* peterm:
2197	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2301	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
2198	* Basically, this is a table of directions, and what directions	2302	* Basically, this is a table of directions, and what directions
…		…
2304	* Add a check so we can't pick up invisible objects (0.93.8)	2408	* Add a check so we can't pick up invisible objects (0.93.8)
2305	*/	2409	*/
2306	int	2410	int
2307	can_pick (const object who, const object item)	2411	can_pick (const object who, const object item)
2308	{	2412	{
2309	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2413	return /who->flag [FLAG_WIZ]\|\| /
2310	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2414	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2311	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));	2415	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2312	}	2416	}
2313		2417
2314	/*	2418	/*
2315	* create clone from object to another	2419	* create clone from object to another
2316	*/	2420	*/
…		…
2348	return tmp;	2452	return tmp;
2349		2453
2350	return 0;	2454	return 0;
2351	}	2455	}
2352		2456
		2457	/* Zero the key_values on op, decrementing the shared-string
		2458	* refcounts and freeing the links.
		2459	*/
		2460	void
		2461	key_values::clear ()
		2462	{
		2463	for (key_value *kvp = first; kvp; )
		2464	{
		2465	key_value *next = kvp->next;
		2466	delete kvp;
		2467	kvp = next;
		2468	}
		2469
		2470	first = 0;
		2471	}
		2472
2353	shstr_tmp	2473	shstr_tmp
2354	object::kv_get (shstr_tmp key) const	2474	key_values::get (shstr_tmp key) const
2355	{	2475	{
2356	for (key_value *kv = key_values; kv; kv = kv->next)	2476	for (key_value *kv = first; kv; kv = kv->next)
2357	if (kv->key == key)	2477	if (kv->key == key)
2358	return kv->value;	2478	return kv->value;
2359		2479
2360	return shstr ();	2480	return shstr ();
2361	}	2481	}
2362		2482
2363	void	2483	void
		2484	key_values::add (shstr_tmp key, shstr_tmp value)
		2485	{
		2486	key_value *kv = new key_value;
		2487
		2488	kv->next = first;
		2489	kv->key = key;
		2490	kv->value = value;
		2491
		2492	first = kv;
		2493	}
		2494
		2495	void
2364	object::kv_set (shstr_tmp key, shstr_tmp value)	2496	key_values::set (shstr_tmp key, shstr_tmp value)
2365	{	2497	{
2366	for (key_value *kv = key_values; kv; kv = kv->next)	2498	for (key_value *kv = first; kv; kv = kv->next)
2367	if (kv->key == key)	2499	if (kv->key == key)
2368	{	2500	{
2369	kv->value = value;	2501	kv->value = value;
2370	return;	2502	return;
2371	}	2503	}
2372		2504
2373	key_value *kv = new key_value;	2505	add (key, value);
2374
2375	kv->next = key_values;
2376	kv->key = key;
2377	kv->value = value;
2378
2379	key_values = kv;
2380	}	2506	}
2381		2507
2382	void	2508	void
2383	object::kv_del (shstr_tmp key)	2509	key_values::del (shstr_tmp key)
2384	{	2510	{
2385	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2511	for (key_value *kvp = &first; kvp; kvp = &(*kvp)->next)
2386	if ((*kvp)->key == key)	2512	if ((*kvp)->key == key)
2387	{	2513	{
2388	key_value kv = kvp;	2514	key_value kv = kvp;
2389	kvp = (kvp)->next;	2515	kvp = (kvp)->next;
2390	delete kv;	2516	delete kv;
2391	return;	2517	return;
2392	}	2518	}
		2519	}
		2520
		2521	void
		2522	key_values::reverse ()
		2523	{
		2524	key_value *prev = 0;
		2525	key_value *head = first;
		2526
		2527	while (head)
		2528	{
		2529	key_value *node = head;
		2530	head = head->next;
		2531	node->next = prev;
		2532	prev = node;
		2533	}
		2534
		2535	first = prev;
		2536	}
		2537
		2538	key_values &
		2539	key_values::operator =(const key_values &kv)
		2540	{
		2541	clear ();
		2542
		2543	for (key_value *kvp = kv.first; kvp; kvp = kvp->next)
		2544	add (kvp->key, kvp->value);
		2545
		2546	reverse ();
2393	}	2547	}
2394		2548
2395	object::depth_iterator::depth_iterator (object *container)	2549	object::depth_iterator::depth_iterator (object *container)
2396	: iterator_base (container)	2550	: iterator_base (container)
2397	{	2551	{
…		…
2577	object::force_add (shstr_tmp name, int duration)	2731	object::force_add (shstr_tmp name, int duration)
2578	{	2732	{
2579	if (object *force = force_find (name))	2733	if (object *force = force_find (name))
2580	force->destroy ();	2734	force->destroy ();
2581		2735
2582	object *force = get_archetype (FORCE_NAME);	2736	object *force = archetype::get (FORCE_NAME);
2583		2737
2584	force->slaying = name;	2738	force->slaying = name;
2585	force->force_set_timer (duration);	2739	force->force_set_timer (duration);
2586	force->flag [FLAG_APPLIED] = true;	2740	force->flag [FLAG_APPLIED] = true;
2587		2741
…		…
2656	}	2810	}
2657	else	2811	else
2658	move_type = mt;	2812	move_type = mt;
2659	}	2813	}
2660		2814
		2815	/* object should be a player.
		2816	* we return the object the player has marked with the 'mark' command
		2817	* below. If no match is found (or object has changed), we return
		2818	* NULL. We leave it up to the calling function to print messages if
		2819	* nothing is found.
		2820	*/
		2821	object *
		2822	object::mark () const
		2823	{
		2824	if (contr && contr->mark && contr->mark->env == this)
		2825	return contr->mark;
		2826	else
		2827	return 0;
		2828	}
		2829
		2830	// put marked object first in the inventory
		2831	// this is used by identify-like spells so players can influence
		2832	// the order a bit.
		2833	void
		2834	object::splay_marked ()
		2835	{
		2836	if (object *marked = mark ())
		2837	splay (marked);
		2838	}
		2839

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.319 by root, Sat Apr 3 02:29:40 2010 UTC vs. Revision 1.345 by root, Sun May 1 16:58:15 2011 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.319 by root, Sat Apr 3 02:29:40 2010 UTC vs.
Revision 1.345 by root, Sun May 1 16:58:15 2011 UTC