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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.308 by root, Sun Nov 29 17:26:28 2009 UTC vs.
Revision 1.338 by root, Fri Jul 2 16:24:24 2010 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 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
10	* Free Software Foundation, either version 3 of the License, or (at your	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.	11	* option) any later version.
26	#include <stdio.h>	26	#include <stdio.h>
27	#include <sys/types.h>	27	#include <sys/types.h>
28	#include <sys/uio.h>	28	#include <sys/uio.h>
29	#include <object.h>	29	#include <object.h>
30	#include <sproto.h>	30	#include <sproto.h>
31	#include <loader.h>
32		31
33	#include <bitset>	32	#include <bitset>
34		33
35	UUID UUID::cur;	34	UUID UUID::cur;
36	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
37	static const uint64 UUID_GAP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
38	uint32_t mapspace::smellcount = 10000;	37	uint32_t mapspace::smellcount = 10000;
39		38
40	objectvec objects;	39	objectvec objects;
41	activevec actives;	40	activevec actives;
		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;
42		47
43	//+GPL	48	//+GPL
44		49
45	short freearr_x[SIZEOFFREE] = {	50	short freearr_x[SIZEOFFREE] = {
46	0,	51	0,
…		…
66	9, 10, 13, 14, 17, 18, 21, 22,	71	9, 10, 13, 14, 17, 18, 21, 22,
67	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,
68	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
69	};	74	};
70		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
71	static void	95	static void
72	write_uuid (uval64 skip, bool sync)	96	write_uuid (uval64 skip, bool sync)
73	{	97	{
74	CALL_BEGIN (2);	98	CALL_BEGIN (2);
75	CALL_ARG_SV (newSVval64 (skip));	99	CALL_ARG_SV (newSVval64 (skip));
…		…
248	* Improvements made with merge: Better checking on potion, and also	272	* Improvements made with merge: Better checking on potion, and also
249	* check weight	273	* check weight
250	*/	274	*/
251	bool object::can_merge_slow (object ob1, object ob2)	275	bool object::can_merge_slow (object ob1, object ob2)
252	{	276	{
253	/* A couple quicksanity checks */	277	/* A couple quick sanity checks */
254	if (ob1 == ob2	278	if (ob1 == ob2
255	\|\| ob1->type != ob2->type	279	\|\| ob1->type != ob2->type
256	\|\| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED
257	\|\| ob1->value != ob2->value	280	\|\| ob1->value != ob2->value
258	\|\| ob1->name != ob2->name)	281	\|\| ob1->name != ob2->name
		282	\|\| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
259	return 0;	283	return 0;
260		284
261	/* Do not merge objects if nrof would overflow, assume nrof	285	/* Do not merge objects if nrof would overflow, assume nrof
262	* is always 0 .. 2*31-1 /	286	* is always 0 .. 2*31-1 /
263	if (ob1->nrof > 0x7fffffff - ob2->nrof)	287	if (ob1->nrof > 0x7fffffff - ob2->nrof)
…		…
267	* This is to the comparison of the flags below will be OK. We	291	* This is to the comparison of the flags below will be OK. We
268	* just can't ignore the been applied or identified flags, as they	292	* just can't ignore the been applied or identified flags, as they
269	* are not equal - just if it has been identified, the been_applied	293	* are not equal - just if it has been identified, the been_applied
270	* flags lose any meaning.	294	* flags lose any meaning.
271	*/	295	*/
272	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	296	if (ob1->flag [FLAG_IDENTIFIED])
273	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	297	ob1->set_flag (FLAG_BEEN_APPLIED);
274		298
275	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	299	if (ob2->flag [FLAG_IDENTIFIED])
276	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	300	ob2->set_flag (FLAG_BEEN_APPLIED);
277		301
278	if (ob1->arch->archname != ob2->arch->archname	302	if (ob1->arch->archname != ob2->arch->archname
279	\|\| ob1->name != ob2->name	303	\|\| ob1->name != ob2->name
280	\|\| ob1->title != ob2->title	304	\|\| ob1->title != ob2->title
281	\|\| ob1->msg != ob2->msg	305	\|\| ob1->msg != ob2->msg
…		…
284	\|\| ob1->magic != ob2->magic	308	\|\| ob1->magic != ob2->magic
285	\|\| ob1->slaying != ob2->slaying	309	\|\| ob1->slaying != ob2->slaying
286	\|\| ob1->skill != ob2->skill	310	\|\| ob1->skill != ob2->skill
287	\|\| ob1->value != ob2->value	311	\|\| ob1->value != ob2->value
288	\|\| ob1->animation_id != ob2->animation_id	312	\|\| ob1->animation_id != ob2->animation_id
289	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other	313	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
290	\|\| ob1->client_type != ob2->client_type	314	\|\| ob1->client_type != ob2->client_type
291	\|\| ob1->material != ob2->material	315	\|\| ob1->material != ob2->material
292	\|\| ob1->lore != ob2->lore	316	\|\| ob1->lore != ob2->lore
293	\|\| ob1->subtype != ob2->subtype	317	\|\| ob1->subtype != ob2->subtype
294	\|\| ob1->move_type != ob2->move_type	318	\|\| ob1->move_type != ob2->move_type
…		…
330		354
331	/* Don't merge objects that are applied. With the new 'body' code,	355	/* Don't merge objects that are applied. With the new 'body' code,
332	* it is possible for most any character to have more than one of	356	* it is possible for most any character to have more than one of
333	* some items equipped, and we don't want those to merge.	357	* some items equipped, and we don't want those to merge.
334	*/	358	*/
335	if (QUERY_FLAG (ob1, FLAG_APPLIED) \|\| QUERY_FLAG (ob2, FLAG_APPLIED))	359	if (ob1->flag [FLAG_APPLIED] \|\| ob2->flag [FLAG_APPLIED])
336	return 0;	360	return 0;
337		361
338	/* Note sure why the following is the case - either the object has to	362	/* Note sure why the following is the case - either the object has to
339	* be animated or have a very low speed. Is this an attempted monster	363	* be animated or have a very low speed. Is this an attempted monster
340	* check?	364	* check?
341	*/	365	*/
342	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	366	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
343	return 0;	367	return 0;
344		368
345	switch (ob1->type)	369	switch (ob1->type)
346	{	370	{
347	case SCROLL:	371	case SCROLL:
…		…
421		445
422	return 0;	446	return 0;
423	}	447	}
424		448
425	// adjust weight per container type ("of holding")	449	// adjust weight per container type ("of holding")
426	static sint32	450	static uint32
427	weight_adjust_for (object *op, sint32 weight)	451	weight_adjust_for (object *op, uint32 weight)
428	{	452	{
429	return op->type == CONTAINER	453	return op->type == CONTAINER
430	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	454	? weight - weight * op->stats.Str / 100
431	: weight;	455	: weight;
432	}	456	}
433		457
434	/*	458	/*
435	* adjust_weight(object, weight) adds the specified weight to an object,	459	* subtracts, then adds, the specified weight to an object,
436	* and also updates how much the environment(s) is/are carrying.	460	* and also updates how much the environment(s) is/are carrying.
437	*/	461	*/
438	static void	462	static void
439	adjust_weight (object *op, sint32 weight)	463	adjust_weight (object *op, sint32 sub, sint32 add)
440	{	464	{
441	while (op)	465	while (op)
442	{	466	{
443	// adjust by actual difference to account for rounding errors	467	sint32 ocarrying = op->carrying;
444	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
445	weight = weight_adjust_for (op, op->carrying)
446	- weight_adjust_for (op, op->carrying - weight);
447		468
448	if (!weight)	469	op->carrying -= weight_adjust_for (op, sub);
449	return;	470	op->carrying += weight_adjust_for (op, add);
450
451	op->carrying += weight;
452		471
453	if (object *pl = op->visible_to ())	472	if (object *pl = op->visible_to ())
454	if (pl != op) // player is handled lazily	473	if (pl != op) // player is handled lazily
455	esrv_update_item (UPD_WEIGHT, pl, op);	474	esrv_update_item (UPD_WEIGHT, pl, op);
456		475
		476	sub = ocarrying;
		477	add = op->carrying;
		478
457	op = op->env;	479	op = op->env;
458	}	480	}
459	}	481	}
460		482
461	/*	483	/*
…		…
468	{	490	{
469	sint32 sum = 0;	491	sint32 sum = 0;
470		492
471	for (object *op = inv; op; op = op->below)	493	for (object *op = inv; op; op = op->below)
472	{	494	{
473	if (op->inv)
474	op->update_weight ();	495	op->update_weight ();
475		496
476	sum += op->total_weight ();	497	sum += weight_adjust_for (this, op->total_weight ());
477	}	498	}
478
479	sum = weight_adjust_for (this, sum);
480		499
481	if (sum != carrying)	500	if (sum != carrying)
482	{	501	{
		502	if (carrying != sum && carrying)//D
		503	LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n",
		504	(long long)sum, (long long)carrying, debug_desc ());
		505
483	carrying = sum;	506	carrying = sum;
484		507
485	if (object *pl = visible_to ())	508	if (object *pl = visible_to ())
486	if (pl != this) // player is handled lazily	509	if (pl != this) // player is handled lazily
487	esrv_update_item (UPD_WEIGHT, pl, this);	510	esrv_update_item (UPD_WEIGHT, pl, this);
…		…
515	object *	538	object *
516	find_object (tag_t i)	539	find_object (tag_t i)
517	{	540	{
518	for_all_objects (op)	541	for_all_objects (op)
519	if (op->count == i)	542	if (op->count == i)
		543	return op;
		544
		545	return 0;
		546	}
		547
		548	/*
		549	* Returns the object which has the uuid equal to the argument.
		550	* MOAR VERRRY slow.
		551	*/
		552
		553	object *
		554	find_object_uuid (UUID i)
		555	{
		556	for_all_objects (op)
		557	if (op->uuid == i)
520	return op;	558	return op;
521		559
522	return 0;	560	return 0;
523	}	561	}
524		562
…		…
558	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());	596	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
559	return;	597	return;
560	}	598	}
561		599
562	this->owner = owner;	600	this->owner = owner;
563	}
564
565	int
566	object::slottype () const
567	{
568	if (type == SKILL)
569	{
570	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
571	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
572	}
573	else
574	{
575	if (slot [body_combat].info) return slot_combat;
576	if (slot [body_range ].info) return slot_ranged;
577	}
578
579	return slot_none;
580	}
581
582	bool
583	object::change_weapon (object *ob)
584	{
585	if (current_weapon == ob)
586	return true;
587
588	if (chosen_skill)
589	chosen_skill->flag [FLAG_APPLIED] = false;
590
591	current_weapon = ob;
592	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
593
594	if (chosen_skill)
595	chosen_skill->flag [FLAG_APPLIED] = true;
596
597	update_stats ();
598
599	if (ob)
600	{
601	// now check wether any body locations became invalid, in which case
602	// we cannot apply the weapon at the moment.
603	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
604	if (slot[i].used < 0)
605	{
606	current_weapon = chosen_skill = 0;
607	update_stats ();
608
609	new_draw_info_format (NDI_UNIQUE, 0, this,
610	"You try to balance all your items at once, "
611	"but the %s is just too much for your body. "
612	"[You need to unapply some items first - use the 'body' command to see "
613	"how many items you cna wera on a specific body part.]", &ob->name);
614	return false;
615	}
616
617	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
618	}
619	else
620	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
621
622	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
623	{
624	LOG (llevError \| logBacktrace, "%s changed to unapplied weapon %s",
625	&name, ob->debug_desc ());
626	return false;
627	}
628
629	return true;
630	}	601	}
631		602
632	/* Zero the key_values on op, decrementing the shared-string	603	/* Zero the key_values on op, decrementing the shared-string
633	* refcounts and freeing the links.	604	* refcounts and freeing the links.
634	*/	605	*/
…		…
736	* be called to update the face variable, _and_ how it looks on the map.	707	* be called to update the face variable, _and_ how it looks on the map.
737	*/	708	*/
738	void	709	void
739	update_turn_face (object *op)	710	update_turn_face (object *op)
740	{	711	{
741	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) \|\| !op->arch)	712	if (!op->flag [FLAG_IS_TURNABLE] \|\| !op->arch)
742	return;	713	return;
743		714
744	SET_ANIMATION (op, op->direction);	715	SET_ANIMATION (op, op->direction);
745	update_object (op, UP_OBJ_FACE);	716	update_object (op, UP_OBJ_FACE);
746	}	717	}
…		…
812	/* nop */;	783	/* nop */;
813	else if (action == UP_OBJ_INSERT)	784	else if (action == UP_OBJ_INSERT)
814	{	785	{
815	#if 0	786	#if 0
816	// this is likely overkill, TODO: revisit (schmorp)	787	// this is likely overkill, TODO: revisit (schmorp)
817	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	788	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
818	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	789	\|\| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
819	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))	790	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
820	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	791	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
821	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	792	\|\| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
822	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	793	\|\| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
823	\|\| (m.move_on \| op->move_on ) != m.move_on	794	\|\| (m.move_on \| op->move_on ) != m.move_on
824	\|\| (m.move_off \| op->move_off ) != m.move_off	795	\|\| (m.move_off \| op->move_off ) != m.move_off
825	\|\| (m.move_slow \| op->move_slow) != m.move_slow	796	\|\| (m.move_slow \| op->move_slow) != m.move_slow
826	/* This isn't perfect, but I don't expect a lot of objects to	797	/* This isn't perfect, but I don't expect a lot of objects to
827	* have move_allow right now.	798	* have move_allow right now.
…		…
848	update_object (op->more, action);	819	update_object (op->more, action);
849	}	820	}
850		821
851	object::object ()	822	object::object ()
852	{	823	{
853	SET_FLAG (this, FLAG_REMOVED);	824	this->set_flag (FLAG_REMOVED);
854		825
855	//expmul = 1.0; declared const for the time being	826	//expmul = 1.0; declared const for the time being
856	face = blank_face;	827	face = blank_face;
857	material = MATERIAL_NULL;	828	material = MATERIAL_NULL;
858	}	829	}
…		…
862	unlink ();	833	unlink ();
863		834
864	free_key_values (this);	835	free_key_values (this);
865	}	836	}
866		837
867	static int object_count;
868
869	void object::link ()	838	void object::link ()
870	{	839	{
871	assert (!index);//D	840	assert (!index);//D
872	uuid = UUID::gen ();	841	uuid = UUID::gen ();
873	count = ++object_count;
874		842
875	refcnt_inc ();	843	refcnt_inc ();
876	objects.insert (this);	844	objects.insert (this);
		845
		846	++create_count;
		847
877	}	848	}
878		849
879	void object::unlink ()	850	void object::unlink ()
880	{	851	{
881	if (!index)	852	if (!index)
882	return;	853	return;
		854
		855	++destroy_count;
883		856
884	objects.erase (this);	857	objects.erase (this);
885	refcnt_dec ();	858	refcnt_dec ();
886	}	859	}
887		860
…		…
992	map->insert (op, x, y);	965	map->insert (op, x, y);
993	}	966	}
994	}	967	}
995	}	968	}
996		969
		970	/*
		971	* Remove and free all objects in the inventory of the given object.
		972	* Unlike destroy_inv, this assumes the *this is destroyed as well
		973	* well, so we can (and have to!) take shortcuts.
		974	*/
		975	void
		976	object::destroy_inv_fast ()
		977	{
		978	while (object *op = inv)
		979	{
		980	// remove from object the fast way
		981	op->flag [FLAG_REMOVED] = true;
		982	op->env = 0;
		983	if ((inv = inv->below))
		984	inv->above = 0;
		985
		986	// then destroy
		987	op->destroy ();
		988	}
		989	}
		990
		991	void
		992	object::freelist_free (int count)
		993	{
		994	while (count-- && freelist)
		995	{
		996	freelist_item *next = freelist->next;
		997	// count is being "destroyed"
		998
		999	sfree ((char *)freelist, sizeof (object));
		1000
		1001	freelist = next;
		1002	--free_count;
		1003	}
		1004	}
		1005
		1006	object *
997	object *object::create ()	1007	object::create ()
998	{	1008	{
999	object *op = new object;	1009	object *op;
		1010
		1011	if (freelist)
		1012	{
		1013	freelist_item li = *freelist;
		1014	memset (freelist, 0, sizeof (object));
		1015
		1016	op = new (freelist) object;
		1017	op->count = li.count;
		1018
		1019	freelist = li.next;
		1020	--free_count;
		1021	}
		1022	else
		1023	{
		1024	void *ni = salloc0<char> (sizeof (object));
		1025
		1026	op = new(ni) object;
		1027
		1028	op->count = ++object_count;
		1029	}
		1030
1000	op->link ();	1031	op->link ();
		1032
1001	return op;	1033	return op;
1002	}	1034	}
1003		1035
		1036	void
		1037	object::do_delete ()
		1038	{
		1039	uint32_t count = this->count;
		1040
		1041	this->~object ();
		1042
		1043	freelist_item li = (freelist_item )this;
		1044	li->next = freelist;
		1045	li->count = count;
		1046
		1047	freelist = li;
		1048	++free_count;
		1049	}
		1050
1004	static struct freed_map : maptile	1051	static struct freed_map : maptile
1005	{	1052	{
1006	freed_map ()	1053	freed_map ()
		1054	: maptile (3, 3)
1007	{	1055	{
1008	path = "<freed objects map>";	1056	path = "<freed objects map>";
1009	name = "/internal/freed_objects_map";	1057	name = "/internal/freed_objects_map";
1010	width = 3;
1011	height = 3;
1012	no_drop = 1;	1058	no_drop = 1;
1013	no_reset = 1;	1059	no_reset = 1;
1014		1060
1015	alloc ();
1016	in_memory = MAP_ACTIVE;	1061	in_memory = MAP_ACTIVE;
1017	}	1062	}
1018		1063
1019	~freed_map ()	1064	~freed_map ()
1020	{	1065	{
…		…
1071	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1116	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1072	head->destroy ();	1117	head->destroy ();
1073	return;	1118	return;
1074	}	1119	}
1075		1120
1076	destroy_inv (false);	1121	destroy_inv_fast ();
1077		1122
1078	if (is_head ())	1123	if (is_head ())
1079	if (sound_destroy)	1124	if (sound_destroy)
1080	play_sound (sound_destroy);	1125	play_sound (sound_destroy);
1081	else if (flag [FLAG_MONSTER])	1126	else if (flag [FLAG_MONSTER])
…		…
1113	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed	1158	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1114	if (object *pl = visible_to ())	1159	if (object *pl = visible_to ())
1115	esrv_del_item (pl->contr, count);	1160	esrv_del_item (pl->contr, count);
1116	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1161	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1117		1162
1118	adjust_weight (env, -total_weight ());	1163	adjust_weight (env, total_weight (), 0);
1119		1164
1120	object *pl = in_player ();	1165	object *pl = in_player ();
1121		1166
1122	/* we set up values so that it could be inserted into	1167	/* we set up values so that it could be inserted into
1123	* the map, but we don't actually do that - it is up	1168	* the map, but we don't actually do that - it is up
…		…
1135	below = 0;	1180	below = 0;
1136	env = 0;	1181	env = 0;
1137		1182
1138	if (pl && pl->is_player ())	1183	if (pl && pl->is_player ())
1139	{	1184	{
		1185	if (expect_false (pl->contr->combat_ob == this))
		1186	{
		1187	pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
		1188	pl->contr->combat_ob = 0;
		1189	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1190	}
		1191
		1192	if (expect_false (pl->contr->ranged_ob == this))
		1193	{
		1194	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
		1195	pl->contr->ranged_ob = 0;
		1196	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1197	}
		1198
1140	pl->contr->queue_stats_update ();	1199	pl->contr->queue_stats_update ();
1141		1200
1142	if (glow_radius && pl->is_on_map ())	1201	if (expect_false (glow_radius) && pl->is_on_map ())
1143	update_all_los (pl->map, pl->x, pl->y);	1202	update_all_los (pl->map, pl->x, pl->y);
1144	}	1203	}
1145	}	1204	}
1146	else if (map)	1205	else if (map)
1147	{	1206	{
…		…
1167	else if (pl->container_ () == this)	1226	else if (pl->container_ () == this)
1168	{	1227	{
1169	// removing a container should close it	1228	// removing a container should close it
1170	close_container ();	1229	close_container ();
1171	}	1230	}
1172		1231	else
1173	esrv_del_item (pl->contr, count);	1232	esrv_del_item (pl->contr, count);
1174	}	1233	}
1175		1234
1176	/* link the object above us */	1235	/* link the object above us */
1177	// re-link, make sure compiler can easily use cmove	1236	// re-link, make sure compiler can easily use cmove
1178	*(above ? &above->below : &ms.top) = below;	1237	*(above ? &above->below : &ms.top) = below;
…		…
1269		1328
1270	object *prev = this;	1329	object *prev = this;
1271		1330
1272	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)	1331	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1273	{	1332	{
1274	object *op = arch_to_object (at);	1333	object *op = at->instance ();
1275		1334
1276	op->name = name;	1335	op->name = name;
1277	op->name_pl = name_pl;	1336	op->name_pl = name_pl;
1278	op->title = title;	1337	op->title = title;
1279		1338
…		…
1317	* Passing 0 for flag gives proper default values, so flag really only needs	1376	* Passing 0 for flag gives proper default values, so flag really only needs
1318	* to be set if special handling is needed.	1377	* to be set if special handling is needed.
1319	*	1378	*
1320	* Return value:	1379	* Return value:
1321	* new object if 'op' was merged with other object	1380	* new object if 'op' was merged with other object
1322	* NULL if 'op' was destroyed	1381	* NULL if there was an error (destroyed, blocked etc.)
1323	* just 'op' otherwise	1382	* just 'op' otherwise
1324	*/	1383	*/
1325	object *	1384	object *
1326	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1385	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1327	{	1386	{
…		…
1364	// from here :/	1423	// from here :/
1365	op->nrof += tmp->nrof;	1424	op->nrof += tmp->nrof;
1366	tmp->destroy ();	1425	tmp->destroy ();
1367	}	1426	}
1368		1427
1369	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1428	op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1370	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1429	op->clr_flag (FLAG_INV_LOCKED);
1371		1430
1372	if (!QUERY_FLAG (op, FLAG_ALIVE))	1431	if (!op->flag [FLAG_ALIVE])
1373	CLEAR_FLAG (op, FLAG_NO_STEAL);	1432	op->clr_flag (FLAG_NO_STEAL);
1374		1433
1375	if (flag & INS_BELOW_ORIGINATOR)	1434	if (flag & INS_BELOW_ORIGINATOR)
1376	{	1435	{
1377	if (originator->map != op->map \|\| originator->x != op->x \|\| originator->y != op->y)	1436	if (originator->map != op->map \|\| originator->x != op->x \|\| originator->y != op->y)
1378	{	1437	{
…		…
1413	* when lots of spells are cast in one area. Currently, it is presumed	1472	* when lots of spells are cast in one area. Currently, it is presumed
1414	* that flying non pickable objects are spell objects.	1473	* that flying non pickable objects are spell objects.
1415	*/	1474	*/
1416	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1475	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1417	{	1476	{
1418	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) \|\| QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))	1477	if (tmp->flag [FLAG_IS_FLOOR] \|\| tmp->flag [FLAG_OVERLAY_FLOOR])
1419	floor = tmp;	1478	floor = tmp;
1420		1479
1421	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1480	if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1422	{	1481	{
1423	/* We insert above top, so we want this object below this */	1482	/* We insert above top, so we want this object below this */
1424	top = tmp->below;	1483	top = tmp->below;
1425	break;	1484	break;
1426	}	1485	}
…		…
1444	&& (op->face && !faces [op->face].visibility))	1503	&& (op->face && !faces [op->face].visibility))
1445	{	1504	{
1446	object *last;	1505	object *last;
1447		1506
1448	for (last = top; last != floor; last = last->below)	1507	for (last = top; last != floor; last = last->below)
1449	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1508	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1450	break;	1509	break;
1451		1510
1452	/* Check to see if we found the object that blocks view,	1511	/* Check to see if we found the object that blocks view,
1453	* and make sure we have a below pointer for it so that	1512	* and make sure we have a below pointer for it so that
1454	* we can get inserted below this one, which requires we	1513	* we can get inserted below this one, which requires we
…		…
1527	*/	1586	*/
1528		1587
1529	/* if this is not the head or flag has been passed, don't check walk on status */	1588	/* if this is not the head or flag has been passed, don't check walk on status */
1530	if (!(flag & INS_NO_WALK_ON) && op->is_head ())	1589	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1531	{	1590	{
1532	if (check_move_on (op, originator))	1591	if (check_move_on (op, originator, flag))
1533	return 0;	1592	return 0;
1534		1593
1535	/* If we are a multi part object, lets work our way through the check	1594	/* If we are a multi part object, let's work our way through the check
1536	* walk on's.	1595	* walk on's.
1537	*/	1596	*/
1538	for (object *tmp = op->more; tmp; tmp = tmp->more)	1597	for (object *tmp = op->more; tmp; tmp = tmp->more)
1539	if (check_move_on (tmp, originator))	1598	if (check_move_on (tmp, originator, flag))
1540	return 0;	1599	return 0;
1541	}	1600	}
1542		1601
1543	return op;	1602	return op;
1544	}	1603	}
…		…
1585	\|\| (items < m->max_items	1644	\|\| (items < m->max_items
1586	&& ms.volume () < m->max_volume))	1645	&& ms.volume () < m->max_volume))
1587	return true;	1646	return true;
1588		1647
1589	if (originator && originator->is_player ())	1648	if (originator && originator->is_player ())
1590	originator->contr->failmsg (format (	1649	originator->contr->failmsgf (
1591	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",	1650	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1592	query_name ()	1651	query_name ()
1593	));	1652	);
1594		1653
1595	return false;	1654	return false;
1596	}	1655	}
1597		1656
1598	/*	1657	/*
…		…
1610		1669
1611	nr = min (nr, nrof);	1670	nr = min (nr, nrof);
1612		1671
1613	if (nrof > nr)	1672	if (nrof > nr)
1614	{	1673	{
		1674	sint64 oweight = total_weight ();
		1675
1615	nrof -= nr;	1676	nrof -= nr;
1616	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1617		1677
1618	if (object *pl = visible_to ())	1678	if (object *pl = visible_to ())
1619	esrv_update_item (UPD_NROF, pl, this);	1679	esrv_update_item (UPD_NROF, pl, this);
		1680
		1681	adjust_weight (env, oweight, total_weight ());
1620		1682
1621	return true;	1683	return true;
1622	}	1684	}
1623	else	1685	else
1624	{	1686	{
…		…
1699	if (op->nrof)	1761	if (op->nrof)
1700	for (object *tmp = inv; tmp; tmp = tmp->below)	1762	for (object *tmp = inv; tmp; tmp = tmp->below)
1701	if (object::can_merge (tmp, op))	1763	if (object::can_merge (tmp, op))
1702	{	1764	{
1703	/* return the original object and remove inserted object	1765	/* return the original object and remove inserted object
1704	(client needs the original object) */	1766	(client prefers the original object) */
		1767
		1768	// carring must be 0 for mergable objects
		1769	sint64 oweight = tmp->weight * tmp->nrof;
		1770
1705	tmp->nrof += op->nrof;	1771	tmp->nrof += op->nrof;
1706		1772
1707	if (object *pl = tmp->visible_to ())	1773	if (object *pl = tmp->visible_to ())
1708	esrv_update_item (UPD_NROF, pl, tmp);	1774	esrv_update_item (UPD_NROF, pl, tmp);
1709		1775
1710	adjust_weight (this, op->total_weight ());	1776	adjust_weight (this, oweight, tmp->weight * tmp->nrof);
1711		1777
1712	op->destroy ();	1778	op->destroy ();
1713	op = tmp;	1779	op = tmp;
1714	goto inserted;	1780	goto inserted;
1715	}	1781	}
…		…
1731	op->flag [FLAG_REMOVED] = 0;	1797	op->flag [FLAG_REMOVED] = 0;
1732		1798
1733	if (object *pl = op->visible_to ())	1799	if (object *pl = op->visible_to ())
1734	esrv_send_item (pl, op);	1800	esrv_send_item (pl, op);
1735		1801
1736	adjust_weight (this, op->total_weight ());	1802	adjust_weight (this, 0, op->total_weight ());
1737		1803
1738	inserted:	1804	inserted:
1739	/* reset the light list and los of the players on the map */	1805	/* reset the light list and los of the players on the map */
1740	if (op->glow_radius && is_on_map ())	1806	if (op->glow_radius && is_on_map ())
1741	{	1807	{
…		…
1770	* MSW 2001-07-08: Check all objects on space, not just those below	1836	* MSW 2001-07-08: Check all objects on space, not just those below
1771	* object being inserted. insert_ob_in_map may not put new objects	1837	* object being inserted. insert_ob_in_map may not put new objects
1772	* on top.	1838	* on top.
1773	*/	1839	*/
1774	int	1840	int
1775	check_move_on (object op, object originator)	1841	check_move_on (object op, object originator, int flags)
1776	{	1842	{
1777	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1843	if (op->flag [FLAG_NO_APPLY])
1778	return 0;	1844	return 0;
1779		1845
1780	object *tmp;	1846	object *tmp;
1781	maptile *m = op->map;	1847	maptile *m = op->map;
1782	int x = op->x, y = op->y;	1848	int x = op->x, y = op->y;
…		…
1819	* Second check makes sure that the movement types not being slowed	1885	* Second check makes sure that the movement types not being slowed
1820	* (~slow_move) is not blocked on this space - just because the	1886	* (~slow_move) is not blocked on this space - just because the
1821	* space doesn't slow down swimming (for example), if you can't actually	1887	* space doesn't slow down swimming (for example), if you can't actually
1822	* swim on that space, can't use it to avoid the penalty.	1888	* swim on that space, can't use it to avoid the penalty.
1823	*/	1889	*/
1824	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1890	if (!op->flag [FLAG_WIZPASS])
1825	{	1891	{
1826	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1892	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1827	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1893	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1828	{	1894	{
1829	float diff = tmp->move_slow_penalty * fabs (op->speed);	1895	float diff = tmp->move_slow_penalty * fabs (op->speed);
…		…
1839		1905
1840	/* Basically same logic as above, except now for actual apply. */	1906	/* Basically same logic as above, except now for actual apply. */
1841	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|	1907	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|
1842	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1908	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1843	{	1909	{
		1910	if ((flags & INS_NO_AUTO_EXIT)
		1911	&& (tmp->type == EXIT \|\| tmp->type == TELEPORTER
		1912	\|\| tmp->type == HOLE \|\| tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead
		1913	continue;
		1914
1844	move_apply (tmp, op, originator);	1915	move_apply (tmp, op, originator);
1845		1916
1846	if (op->destroyed ())	1917	if (op->destroyed ())
1847	return 1;	1918	return 1;
1848		1919
…		…
1960	void	2031	void
1961	flag_inv (object *op, int flag)	2032	flag_inv (object *op, int flag)
1962	{	2033	{
1963	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2034	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1964	{	2035	{
1965	SET_FLAG (tmp, flag);	2036	tmp->set_flag (flag);
1966	flag_inv (tmp, flag);	2037	flag_inv (tmp, flag);
1967	}	2038	}
1968	}	2039	}
1969		2040
1970	/*	2041	/*
…		…
1973	void	2044	void
1974	unflag_inv (object *op, int flag)	2045	unflag_inv (object *op, int flag)
1975	{	2046	{
1976	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2047	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1977	{	2048	{
1978	CLEAR_FLAG (tmp, flag);	2049	tmp->clr_flag (flag);
1979	unflag_inv (tmp, flag);	2050	unflag_inv (tmp, flag);
1980	}	2051	}
1981	}	2052	}
1982		2053
1983	/*	2054	/*
…		…
2173	{	2244	{
2174	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2245	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2175	}	2246	}
2176		2247
2177	/*	2248	/*
2178	* find_dir_2(delta-x,delta-y) will return a direction in which	2249	* find_dir_2(delta-x,delta-y) will return a direction value
2179	* an object which has subtracted the x and y coordinates of another	2250	* for running into direct [dx, dy].
2180	* object, needs to travel toward it.	2251	* (the opposite of crossfire's find_dir_2!)
2181	*/	2252	*/
2182	int	2253	int
2183	find_dir_2 (int x, int y)	2254	find_dir_2 (int x, int y)
2184	{	2255	{
		2256	#if 1 // new algorithm
		2257	// this works by putting x, y into 16 sectors, which
		2258	// are not equal sized, but are a better approximation
		2259	// then the old algorithm, and then using a mapping
		2260	// table to map it into a direction value.
		2261	// basically, it maps these comparisons to each bit
		2262	// bit #3: x < 0
		2263	// bit #2: y < 0
		2264	// bit #1: x > y
		2265	// bit #0: x > 2y
		2266
		2267	static const uint8 dir[16] = {
		2268	4, 5, 4, 3,
		2269	2, 1, 2, 3,
		2270	6, 5, 6, 7,
		2271	8, 1, 8, 7,
		2272	};
		2273	int sector = 0;
		2274
		2275	// this is a bit ugly, but more likely to result in branchless code
		2276	sector \|= x < 0 ? 8 : 0;
		2277	x = x < 0 ? -x : x; // abs
		2278
		2279	sector \|= y < 0 ? 4 : 0;
		2280	y = y < 0 ? -y : y; // abs
		2281
		2282	if (x > y)
		2283	{
		2284	sector \|= 2;
		2285
		2286	if (x > y * 2)
		2287	sector \|= 1;
		2288	}
		2289	else
		2290	{
		2291	if (y > x * 2)
		2292	sector \|= 1;
		2293	else if (!y)
		2294	return 0; // x == 0 here
		2295	}
		2296
		2297	return dir [sector];
		2298	#else // old algorithm
2185	int q;	2299	int q;
2186		2300
2187	if (y)	2301	if (y)
2188	q = x * 100 / y;	2302	q = 128 * x / y;
2189	else if (x)	2303	else if (x)
2190	q = -300 * x;	2304	q = -512 * x; // to make it > 309
2191	else	2305	else
2192	return 0;	2306	return 0;
2193		2307
2194	if (y > 0)	2308	if (y > 0)
2195	{	2309	{
2196	if (q < -242)	2310	if (q < -309) return 7;
		2311	if (q < -52) return 6;
		2312	if (q < 52) return 5;
		2313	if (q < 309) return 4;
		2314
2197	return 3;	2315	return 3;
2198	if (q < -41)	2316	}
2199	return 2;	2317	else
2200	if (q < 41)	2318	{
2201	return 1;	2319	if (q < -309) return 3;
2202	if (q < 242)	2320	if (q < -52) return 2;
2203	return 8;	2321	if (q < 52) return 1;
		2322	if (q < 309) return 8;
		2323
2204	return 7;	2324	return 7;
2205	}	2325	}
2206		2326	#endif
2207	if (q < -242)
2208	return 7;
2209	if (q < -41)
2210	return 6;
2211	if (q < 41)
2212	return 5;
2213	if (q < 242)
2214	return 4;
2215
2216	return 3;
2217	}	2327	}
2218		2328
2219	/*	2329	/*
2220	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2330	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2221	* between two directions (which are expected to be absolute (see absdir())	2331	* between two directions (which are expected to be absolute (see absdir())
2222	*/	2332	*/
2223	int	2333	int
2224	dirdiff (int dir1, int dir2)	2334	dirdiff (int dir1, int dir2)
2225	{	2335	{
2226	int d;
2227
2228	d = abs (dir1 - dir2);	2336	int d = abs (dir1 - dir2);
2229	if (d > 4)
2230	d = 8 - d;
2231		2337
2232	return d;	2338	return d > 4 ? 8 - d : d;
2233	}	2339	}
2234		2340
2235	/* peterm:	2341	/* peterm:
2236	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2342	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
2237	* Basically, this is a table of directions, and what directions	2343	* Basically, this is a table of directions, and what directions
…		…
2343	* Add a check so we can't pick up invisible objects (0.93.8)	2449	* Add a check so we can't pick up invisible objects (0.93.8)
2344	*/	2450	*/
2345	int	2451	int
2346	can_pick (const object who, const object item)	2452	can_pick (const object who, const object item)
2347	{	2453	{
2348	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2454	return /who->flag [FLAG_WIZ]\|\| /
2349	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2455	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2350	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));	2456	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2351	}	2457	}
2352		2458
2353	/*	2459	/*
2354	* create clone from object to another	2460	* create clone from object to another
2355	*/	2461	*/
…		…
2563	// TODO: this does not seem to serve any purpose anymore?	2669	// TODO: this does not seem to serve any purpose anymore?
2564	#if 0	2670	#if 0
2565	// insert the "Close Container" object.	2671	// insert the "Close Container" object.
2566	if (archetype *closer = new_container->other_arch)	2672	if (archetype *closer = new_container->other_arch)
2567	{	2673	{
2568	object *closer = arch_to_object (new_container->other_arch);	2674	object *closer = new_container->other_arch->instance ();
2569	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2675	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2570	new_container->insert (closer);	2676	new_container->insert (closer);
2571	}	2677	}
2572	#endif	2678	#endif
2573		2679
…		…
2679		2785
2680	insert (force);	2786	insert (force);
2681	}	2787	}
2682	}	2788	}
2683		2789
		2790	void object::change_move_type (MoveType mt)
		2791	{
		2792	if (move_type == mt)
		2793	return;
		2794
		2795	if (is_on_map ())
		2796	{
		2797	// we are on the map, so handle move_on/off effects
		2798	remove ();
		2799	move_type = mt;
		2800	map->insert (this, x, y, this);
		2801	}
		2802	else
		2803	move_type = mt;
		2804	}
		2805
		2806	/* object should be a player.
		2807	* we return the object the player has marked with the 'mark' command
		2808	* below. If no match is found (or object has changed), we return
		2809	* NULL. We leave it up to the calling function to print messages if
		2810	* nothing is found.
		2811	*/
		2812	object *
		2813	object::mark () const
		2814	{
		2815	if (contr && contr->mark && contr->mark->env == this)
		2816	return contr->mark;
		2817	else
		2818	return 0;
		2819	}
		2820

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.308 by root, Sun Nov 29 17:26:28 2009 UTC vs. Revision 1.338 by root, Fri Jul 2 16:24:24 2010 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.308 by root, Sun Nov 29 17:26:28 2009 UTC vs.
Revision 1.338 by root, Fri Jul 2 16:24:24 2010 UTC