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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.241 by root, Wed May 7 19:19:09 2008 UTC vs.
Revision 1.312 by elmex, Sat Mar 20 00:42:08 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 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,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 it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <global.h>	25	#include <global.h>
25	#include <stdio.h>	26	#include <stdio.h>
26	#include <sys/types.h>	27	#include <sys/types.h>
27	#include <sys/uio.h>	28	#include <sys/uio.h>
28	#include <object.h>	29	#include <object.h>
29	#include <sproto.h>	30	#include <sproto.h>
30	#include <loader.h>
31		31
32	#include <bitset>	32	#include <bitset>
33		33
34	UUID UUID::cur;	34	UUID UUID::cur;
35	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
		37	uint32_t mapspace::smellcount = 10000;
37		38
38	objectvec objects;	39	objectvec objects;
39	activevec actives;	40	activevec actives;
		41
		42	//+GPL
40		43
41	short freearr_x[SIZEOFFREE] = {	44	short freearr_x[SIZEOFFREE] = {
42	0,	45	0,
43	0, 1, 1, 1, 0, -1, -1, -1,	46	0, 1, 1, 1, 0, -1, -1, -1,
44	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	47	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
48	0,	51	0,
49	-1, -1, 0, 1, 1, 1, 0, -1,	52	-1, -1, 0, 1, 1, 1, 0, -1,
50	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	53	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
51	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	54	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
52	};	55	};
53	int maxfree[SIZEOFFREE] = {
54	0,
55	9, 10, 13, 14, 17, 18, 21, 22,
56	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
57	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
58	};
59	int freedir[SIZEOFFREE] = {	56	int freedir[SIZEOFFREE] = {
60	0,	57	0,
61	1, 2, 3, 4, 5, 6, 7, 8,	58	1, 2, 3, 4, 5, 6, 7, 8,
62	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	59	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
63	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	60	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
64	};	61	};
65		62
		63	static int maxfree[SIZEOFFREE] = {
		64	0,
		65	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,
		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
		68	};
		69
66	static void	70	static void
67	write_uuid (uval64 skip, bool sync)	71	write_uuid (uval64 skip, bool sync)
68	{	72	{
69	CALL_BEGIN (2);	73	CALL_BEGIN (2);
70	CALL_ARG_SV (newSVval64 (skip));	74	CALL_ARG_SV (newSVval64 (skip));
…		…
72	CALL_CALL ("cf::write_uuid", G_DISCARD);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
73	CALL_END;	77	CALL_END;
74	}	78	}
75		79
76	static void	80	static void
77	read_uuid (void)	81	read_uuid ()
78	{	82	{
79	char filename[MAX_BUF];	83	char filename[MAX_BUF];
80		84
81	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
82		86
…		…
96		100
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	102	_exit (1);
99	}	103	}
100		104
101	UUID::BUF buf;	105	char buf [UUID::MAX_LEN];
102	buf[0] = 0;	106	buf[0] = 0;
103	fgets (buf, sizeof (buf), fp);	107	fgets (buf, sizeof (buf), fp);
104		108
105	if (!UUID::cur.parse (buf))	109	if (!UUID::cur.parse (buf))
106	{	110	{
…		…
133		137
134	void	138	void
135	UUID::init ()	139	UUID::init ()
136	{	140	{
137	read_uuid ();	141	read_uuid ();
		142	}
		143
		144	bool
		145	UUID::parse (const char *s)
		146	{
		147	if (s++ != '<' \|\| s++ != '1' \|\| *s++ != '.')
		148	return false;
		149
		150	seq = 0;
		151
		152	while (*s != '>')
		153	{
		154	if (*s < '0')
		155	return false;
		156
		157	// this gives nice branchless code with gcc
		158	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		159	int digit = (s + (s & 0x40 ? 9 : 0)) & 15;
		160
		161	seq = (seq << 4) \| digit;
		162
		163	++s;
		164	}
		165
		166	return true;
		167	}
		168
		169	char *
		170	UUID::append (char *buf) const
		171	{
		172	*buf++ = '<';
		173	*buf++ = '1';
		174	*buf++ = '.';
		175
		176	uint64_t seq = this->seq;
		177	const int bits = 64;
		178	char nz = 0;
		179	static const char tohex [] = "0123456789abcdef";
		180
		181	// assert (len >= 3 + bits / 4 + 1 + 1);
		182	for (int i = bits / 4; --i; )
		183	{
		184	uint8_t digit = seq >> (bits - 4);
		185
		186	*buf = tohex [digit];
		187	nz \|= digit;
		188	buf += nz ? 1 : 0;
		189	seq <<= 4;
		190	}
		191
		192	// last digit is special - always emit
		193	uint8_t digit = seq >> (bits - 4);
		194	*buf++ = tohex [digit];
		195
		196	*buf++ = '>';
		197
		198	return buf;
		199	}
		200
		201	char *
		202	UUID::c_str () const
		203	{
		204	static char buf [MAX_LEN];
		205	*append (buf) = 0;
		206	return buf;
138	}	207	}
139		208
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	209	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	210	static bool
142	compare_ob_value_lists_one (const object wants, const object has)	211	compare_ob_value_lists_one (const object wants, const object has)
…		…
178	* Improvements made with merge: Better checking on potion, and also	247	* Improvements made with merge: Better checking on potion, and also
179	* check weight	248	* check weight
180	*/	249	*/
181	bool object::can_merge_slow (object ob1, object ob2)	250	bool object::can_merge_slow (object ob1, object ob2)
182	{	251	{
183	/* A couple quicksanity checks */	252	/* A couple quick sanity checks */
184	if (ob1 == ob2	253	if (ob1 == ob2
185	\|\| ob1->type != ob2->type	254	\|\| ob1->type != ob2->type
186	\|\| ob1->speed != ob2->speed
187	\|\| ob1->value != ob2->value	255	\|\| ob1->value != ob2->value
188	\|\| ob1->name != ob2->name)	256	\|\| ob1->name != ob2->name
		257	\|\| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
189	return 0;	258	return 0;
190		259
191	/* Do not merge objects if nrof would overflow. First part checks	260	/* Do not merge objects if nrof would overflow, assume nrof
192	* for unsigned overflow (2c), second part checks whether the result	261	* is always 0 .. 2*31-1 /
193	* would fit into a 32 bit signed int, which is often used to hold	262	if (ob1->nrof > 0x7fffffff - ob2->nrof)
194	* nrof values.
195	*/
196	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
197	return 0;	263	return 0;
198		264
199	/* If the objects have been identified, set the BEEN_APPLIED flag.	265	/* If the objects have been identified, set the BEEN_APPLIED flag.
200	* This is to the comparison of the flags below will be OK. We	266	* This is to the comparison of the flags below will be OK. We
201	* just can't ignore the been applied or identified flags, as they	267	* just can't ignore the been applied or identified flags, as they
…		…
206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	272	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
207		273
208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	274	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	275	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
210		276
211	if (ob1->arch->name != ob2->arch->name	277	if (ob1->arch->archname != ob2->arch->archname
212	\|\| ob1->name != ob2->name	278	\|\| ob1->name != ob2->name
213	\|\| ob1->title != ob2->title	279	\|\| ob1->title != ob2->title
214	\|\| ob1->msg != ob2->msg	280	\|\| ob1->msg != ob2->msg
215	\|\| ob1->weight != ob2->weight	281	\|\| ob1->weight != ob2->weight
216	\|\| ob1->attacktype != ob2->attacktype	282	\|\| ob1->attacktype != ob2->attacktype
217	\|\| ob1->magic != ob2->magic	283	\|\| ob1->magic != ob2->magic
218	\|\| ob1->slaying != ob2->slaying	284	\|\| ob1->slaying != ob2->slaying
219	\|\| ob1->skill != ob2->skill	285	\|\| ob1->skill != ob2->skill
220	\|\| ob1->value != ob2->value	286	\|\| ob1->value != ob2->value
221	\|\| ob1->animation_id != ob2->animation_id	287	\|\| ob1->animation_id != ob2->animation_id
		288	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
222	\|\| ob1->client_type != ob2->client_type	289	\|\| ob1->client_type != ob2->client_type
223	\|\| ob1->materialname != ob2->materialname	290	\|\| ob1->material != ob2->material
224	\|\| ob1->lore != ob2->lore	291	\|\| ob1->lore != ob2->lore
225	\|\| ob1->subtype != ob2->subtype	292	\|\| ob1->subtype != ob2->subtype
226	\|\| ob1->move_type != ob2->move_type	293	\|\| ob1->move_type != ob2->move_type
227	\|\| ob1->move_block != ob2->move_block	294	\|\| ob1->move_block != ob2->move_block
228	\|\| ob1->move_allow != ob2->move_allow	295	\|\| ob1->move_allow != ob2->move_allow
229	\|\| ob1->move_on != ob2->move_on	296	\|\| ob1->move_on != ob2->move_on
230	\|\| ob1->move_off != ob2->move_off	297	\|\| ob1->move_off != ob2->move_off
231	\|\| ob1->move_slow != ob2->move_slow	298	\|\| ob1->move_slow != ob2->move_slow
232	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty	299	\|\| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
233	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	300	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	301	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235	return 0;	302	return 0;
236		303
237	if ((ob1->flag ^ ob2->flag)	304	if ((ob1->flag ^ ob2->flag)
238	.reset (FLAG_INV_LOCKED)	305	.reset (FLAG_INV_LOCKED)
239	.reset (FLAG_CLIENT_SENT)
240	.reset (FLAG_REMOVED)	306	.reset (FLAG_REMOVED)
241	.any ())	307	.any ())
242	return 0;	308	return 0;
243		309
244	/* This is really a spellbook check - we should in general	310	/* This is really a spellbook check - we should in general
…		…
326	{	392	{
327	// see if we are in a container of sorts	393	// see if we are in a container of sorts
328	if (env)	394	if (env)
329	{	395	{
330	// the player inventory itself is always visible	396	// the player inventory itself is always visible
331	if (env->type == PLAYER)	397	if (env->is_player ())
332	return env;	398	return env;
333		399
334	// else a player could have our env open	400	// else a player could have our env open
335	object *envest = env->outer_env ();	401	object *envest = env->outer_env_or_self ();
336		402
337	// the player itself is always on a map, so we will find him here	403	// the player itself is always on a map, so we will find him here
338	// even if our inv is in a player.	404	// even if our inv is in a player.
339	if (envest->is_on_map ())	405	if (envest->is_on_map ())
340	if (object *pl = envest->ms ().player ())	406	if (object *pl = envest->ms ().player ())
341	if (pl->container == env)	407	if (pl->container_ () == env)
342	return pl;	408	return pl;
343	}	409	}
344	else	410	else
345	{	411	{
346	// maybe there is a player standing on the same mapspace	412	// maybe there is a player standing on the same mapspace
347	// this will catch the case where "this" is a player	413	// this will catch the case where "this" is a player
348	if (object *pl = ms ().player ())	414	if (object *pl = ms ().player ())
349	if (!pl->container \|\| this == pl->container)	415	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		416	\|\| pl->container_ () == this)
350	return pl;	417	return pl;
351	}	418	}
352	}	419	}
353		420
354	return 0;	421	return 0;
…		…
432	object_freezer freezer;	499	object_freezer freezer;
433	op->write (freezer);	500	op->write (freezer);
434	return freezer.as_string ();	501	return freezer.as_string ();
435	}	502	}
436		503
437	/*	504	char *
438	* get_nearest_part(multi-object, object 2) returns the part of the	505	object::as_string ()
439	* multi-object 1 which is closest to the second object.
440	* If it's not a multi-object, it is returned.
441	*/
442	object *
443	get_nearest_part (object op, const object pl)
444	{	506	{
445	object tmp, closest;	507	return dump_object (this);
446	int last_dist, i;
447
448	if (!op->more)
449	return op;
450
451	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
452	tmp;
453	tmp = tmp->more)
454	if ((i = distance (tmp, pl)) < last_dist)
455	closest = tmp, last_dist = i;
456
457	return closest;
458	}	508	}
459		509
460	/*	510	/*
461	* Returns the object which has the count-variable equal to the argument.	511	* Returns the object which has the count-variable equal to the argument.
462	* VERRRY slow.	512	* VERRRY slow.
…		…
470		520
471	return 0;	521	return 0;
472	}	522	}
473		523
474	/*	524	/*
		525	* Returns the object which has the uuid equal to the argument.
		526	* MOAR VERRRY slow.
		527	*/
		528
		529	object *
		530	find_object_uuid (UUID i)
		531	{
		532	for_all_objects (op)
		533	if (op->uuid == i)
		534	return op;
		535
		536	return 0;
		537	}
		538
		539	/*
475	* Returns the first object which has a name equal to the argument.	540	* Returns the first object which has a name equal to the argument.
476	* Used only by the patch command, but not all that useful.	541	* Used only by the patch command, but not all that useful.
477	* Enables features like "patch <name-of-other-player> food 999"	542	* Enables features like "patch <name-of-other-player> food 999"
478	*/	543	*/
479	object *	544	object *
480	find_object_name (const char *str)	545	find_object_name (const char *str)
481	{	546	{
482	shstr_cmp str_ (str);	547	shstr_cmp str_ (str);
483	object *op;
484		548
		549	if (str_)
485	for_all_objects (op)	550	for_all_objects (op)
486	if (op->name == str_)	551	if (op->name == str_)
487	break;	552	return op;
488		553
489	return op;	554	return 0;
490	}	555	}
491		556
492	/*	557	/*
493	* Sets the owner and sets the skill and exp pointers to owner's current	558	* Sets the owner and sets the skill and exp pointers to owner's current
494	* skill and experience objects.	559	* skill and experience objects.
…		…
556	update_stats ();	621	update_stats ();
557		622
558	new_draw_info_format (NDI_UNIQUE, 0, this,	623	new_draw_info_format (NDI_UNIQUE, 0, this,
559	"You try to balance all your items at once, "	624	"You try to balance all your items at once, "
560	"but the %s is just too much for your body. "	625	"but the %s is just too much for your body. "
561	"[You need to unapply some items first.]", &ob->name);	626	"[You need to unapply some items first - use the 'body' command to see "
		627	"how many items you cna wera on a specific body part.]", &ob->name);
562	return false;	628	return false;
563	}	629	}
564		630
565	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	631	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
566	}	632	}
…		…
635	tail = new_link;	701	tail = new_link;
636	}	702	}
637	}	703	}
638	}	704	}
639		705
640	if (speed < 0)	706	dst->activate ();
641	dst->speed_left -= rndm ();
642
643	dst->set_speed (dst->speed);
644	}	707	}
645		708
646	void	709	void
647	object::instantiate ()	710	object::instantiate ()
648	{	711	{
649	if (!uuid.seq) // HACK	712	if (!uuid.seq) // HACK
650	uuid = UUID::gen ();	713	uuid = UUID::gen ();
651		714
		715	// TODO: unclean state changes, should nt be done in copy_to AND instantiate
		716	if (flag [FLAG_RANDOM_SPEED] && speed)
		717	speed_left = - speed - rndm (); // TODO animation
		718	else
652	speed_left = -0.1f;	719	speed_left = -1.;
		720
653	/* copy the body_info to the body_used - this is only really	721	/* copy the body_info to the body_used - this is only really
654	* need for monsters, but doesn't hurt to do it for everything.	722	* need for monsters, but doesn't hurt to do it for everything.
655	* by doing so, when a monster is created, it has good starting	723	* by doing so, when a monster is created, it has good starting
656	* values for the body_used info, so when items are created	724	* values for the body_used info, so when items are created
657	* for it, they can be properly equipped.	725	* for it, they can be properly equipped.
…		…
665	object *	733	object *
666	object::clone ()	734	object::clone ()
667	{	735	{
668	object *neu = create ();	736	object *neu = create ();
669	copy_to (neu);	737	copy_to (neu);
		738
		739	// TODO: unclean state changes, should not be done in clone AND instantiate
		740	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		741	neu->speed_left = - neu->speed - rndm (); // TODO animation
		742
670	neu->map = map; // not copied by copy_to	743	neu->map = map; // not copied by copy_to
671	return neu;	744	return neu;
672	}	745	}
673		746
674	/*	747	/*
…		…
692	* This function needs to be called whenever the speed of an object changes.	765	* This function needs to be called whenever the speed of an object changes.
693	*/	766	*/
694	void	767	void
695	object::set_speed (float speed)	768	object::set_speed (float speed)
696	{	769	{
697	if (flag [FLAG_FREED] && speed)
698	{
699	LOG (llevError, "Object %s is freed but has speed.\n", &name);
700	speed = 0;
701	}
702
703	this->speed = speed;	770	this->speed = speed;
704		771
705	if (has_active_speed ())	772	if (has_active_speed ())
706	activate ();	773	activate ();
707	else	774	else
…		…
757		824
758	if (!(m.flags_ & P_UPTODATE))	825	if (!(m.flags_ & P_UPTODATE))
759	/* nop */;	826	/* nop */;
760	else if (action == UP_OBJ_INSERT)	827	else if (action == UP_OBJ_INSERT)
761	{	828	{
		829	#if 0
762	// this is likely overkill, TODO: revisit (schmorp)	830	// this is likely overkill, TODO: revisit (schmorp)
763	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	831	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
764	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	832	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
765	\|\| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	833	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
766	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	834	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
767	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	835	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
768	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	836	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
769	\|\| (m.move_on \| op->move_on ) != m.move_on	837	\|\| (m.move_on \| op->move_on ) != m.move_on
770	\|\| (m.move_off \| op->move_off ) != m.move_off	838	\|\| (m.move_off \| op->move_off ) != m.move_off
771	\|\| (m.move_slow \| op->move_slow) != m.move_slow	839	\|\| (m.move_slow \| op->move_slow) != m.move_slow
772	/* This isn't perfect, but I don't expect a lot of objects to	840	/* This isn't perfect, but I don't expect a lot of objects to
773	* to have move_allow right now.	841	* have move_allow right now.
774	*/	842	*/
775	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block	843	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block
		844	m.invalidate ();
		845	#else
776	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	846	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
777	m.flags_ = 0;	847	m.invalidate ();
		848	#endif
778	}	849	}
779	/* if the object is being removed, we can't make intelligent	850	/* if the object is being removed, we can't make intelligent
780	* decisions, because remove_ob can't really pass the object	851	* decisions, because remove_ob can't really pass the object
781	* that is being removed.	852	* that is being removed.
782	*/	853	*/
783	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	854	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
784	m.flags_ = 0;	855	m.invalidate ();
785	else if (action == UP_OBJ_FACE)	856	else if (action == UP_OBJ_FACE)
786	/* Nothing to do for that case */ ;	857	/* Nothing to do for that case */ ;
787	else	858	else
788	LOG (llevError, "update_object called with invalid action: %d\n", action);	859	LOG (llevError, "update_object called with invalid action: %d\n", action);
789		860
…		…
793		864
794	object::object ()	865	object::object ()
795	{	866	{
796	SET_FLAG (this, FLAG_REMOVED);	867	SET_FLAG (this, FLAG_REMOVED);
797		868
798	expmul = 1.0;	869	//expmul = 1.0; declared const for the time being
799	face = blank_face;	870	face = blank_face;
		871	material = MATERIAL_NULL;
800	}	872	}
801		873
802	object::~object ()	874	object::~object ()
803	{	875	{
804	unlink ();	876	unlink ();
…		…
833	/* If already on active list, don't do anything */	905	/* If already on active list, don't do anything */
834	if (active)	906	if (active)
835	return;	907	return;
836		908
837	if (has_active_speed ())	909	if (has_active_speed ())
		910	{
		911	if (flag [FLAG_FREED])
		912	LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		913
838	actives.insert (this);	914	actives.insert (this);
		915	}
839	}	916	}
840		917
841	void	918	void
842	object::activate_recursive ()	919	object::activate_recursive ()
843	{	920	{
…		…
908	\|\| map->in_memory != MAP_ACTIVE	985	\|\| map->in_memory != MAP_ACTIVE
909	\|\| map->no_drop	986	\|\| map->no_drop
910	\|\| ms ().move_block == MOVE_ALL)	987	\|\| ms ().move_block == MOVE_ALL)
911	{	988	{
912	while (inv)	989	while (inv)
913	{
914	inv->destroy_inv (false);
915	inv->destroy ();	990	inv->destroy ();
916	}
917	}	991	}
918	else	992	else
919	{ /* Put objects in inventory onto this space */	993	{ /* Put objects in inventory onto this space */
920	while (inv)	994	while (inv)
921	{	995	{
…		…
925	\|\| op->flag [FLAG_NO_DROP]	999	\|\| op->flag [FLAG_NO_DROP]
926	\|\| op->type == RUNE	1000	\|\| op->type == RUNE
927	\|\| op->type == TRAP	1001	\|\| op->type == TRAP
928	\|\| op->flag [FLAG_IS_A_TEMPLATE]	1002	\|\| op->flag [FLAG_IS_A_TEMPLATE]
929	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	1003	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
930	op->destroy (true);	1004	op->destroy ();
931	else	1005	else
932	map->insert (op, x, y);	1006	map->insert (op, x, y);
933	}	1007	}
934	}	1008	}
935	}	1009	}
…		…
964		1038
965	void	1039	void
966	object::do_destroy ()	1040	object::do_destroy ()
967	{	1041	{
968	if (flag [FLAG_IS_LINKED])	1042	if (flag [FLAG_IS_LINKED])
969	remove_button_link (this);	1043	remove_link ();
970		1044
971	if (flag [FLAG_FRIENDLY])	1045	if (flag [FLAG_FRIENDLY])
972	remove_friendly_object (this);	1046	remove_friendly_object (this);
973		1047
974	remove ();	1048	remove ();
…		…
999	attacked_by = 0;	1073	attacked_by = 0;
1000	current_weapon = 0;	1074	current_weapon = 0;
1001	}	1075	}
1002		1076
1003	void	1077	void
1004	object::destroy (bool destroy_inventory)	1078	object::destroy ()
1005	{	1079	{
1006	if (destroyed ())	1080	if (destroyed ())
1007	return;	1081	return;
1008		1082
1009	if (!is_head () && !head->destroyed ())	1083	if (!is_head () && !head->destroyed ())
1010	{	1084	{
1011	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1085	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1012	head->destroy (destroy_inventory);	1086	head->destroy ();
1013	return;	1087	return;
1014	}	1088	}
1015		1089
1016	destroy_inv (!destroy_inventory);	1090	destroy_inv (false);
1017		1091
1018	if (is_head ())	1092	if (is_head ())
1019	if (sound_destroy)	1093	if (sound_destroy)
1020	play_sound (sound_destroy);	1094	play_sound (sound_destroy);
1021	else if (flag [FLAG_MONSTER])	1095	else if (flag [FLAG_MONSTER])
…		…
1032	* the previous environment.	1106	* the previous environment.
1033	*/	1107	*/
1034	void	1108	void
1035	object::do_remove ()	1109	object::do_remove ()
1036	{	1110	{
1037	object tmp, last = 0;
1038	object *otmp;
1039
1040	if (flag [FLAG_REMOVED])	1111	if (flag [FLAG_REMOVED])
1041	return;	1112	return;
1042		1113
1043	INVOKE_OBJECT (REMOVE, this);	1114	INVOKE_OBJECT (REMOVE, this);
1044		1115
…		…
1057	if (object *pl = visible_to ())	1128	if (object *pl = visible_to ())
1058	esrv_del_item (pl->contr, count);	1129	esrv_del_item (pl->contr, count);
1059	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1130	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1060		1131
1061	adjust_weight (env, -total_weight ());	1132	adjust_weight (env, -total_weight ());
		1133
		1134	object *pl = in_player ();
1062		1135
1063	/* we set up values so that it could be inserted into	1136	/* we set up values so that it could be inserted into
1064	* the map, but we don't actually do that - it is up	1137	* the map, but we don't actually do that - it is up
1065	* to the caller to decide what we want to do.	1138	* to the caller to decide what we want to do.
1066	*/	1139	*/
…		…
1074		1147
1075	above = 0;	1148	above = 0;
1076	below = 0;	1149	below = 0;
1077	env = 0;	1150	env = 0;
1078		1151
1079	/* NO_FIX_PLAYER is set when a great many changes are being	1152	if (pl && pl->is_player ())
1080	* made to players inventory. If set, avoiding the call
1081	* to save cpu time.
1082	*/	1153	{
1083	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1154	pl->contr->queue_stats_update ();
1084	otmp->update_stats ();	1155
		1156	if (glow_radius && pl->is_on_map ())
		1157	update_all_los (pl->map, pl->x, pl->y);
		1158	}
1085	}	1159	}
1086	else if (map)	1160	else if (map)
1087	{	1161	{
1088	map->dirty = true;	1162	map->dirty = true;
1089	mapspace &ms = this->ms ();	1163	mapspace &ms = this->ms ();
1090		1164
1091	if (object *pl = ms.player ())	1165	if (object *pl = ms.player ())
1092	{	1166	{
1093	if (type == PLAYER) // this == pl(!)	1167	if (is_player ())
1094	{	1168	{
		1169	if (!flag [FLAG_WIZPASS])
		1170	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1171
1095	// leaving a spot always closes any open container on the ground	1172	// leaving a spot always closes any open container on the ground
1096	if (container && !container->env)	1173	if (container && !container->env)
1097	// this causes spurious floorbox updates, but it ensures	1174	// this causes spurious floorbox updates, but it ensures
1098	// that the CLOSE event is being sent.	1175	// that the CLOSE event is being sent.
1099	close_container ();	1176	close_container ();
1100		1177
1101	--map->players;	1178	--map->players;
1102	map->touch ();	1179	map->touch ();
1103	}	1180	}
1104	else if (pl->container == this)	1181	else if (pl->container_ () == this)
1105	{	1182	{
1106	// removing a container should close it	1183	// removing a container should close it
1107	close_container ();	1184	close_container ();
1108	}	1185	}
1109		1186
…		…
1116	*(below ? &below->above : &ms.bot) = above;	1193	*(below ? &below->above : &ms.bot) = above;
1117		1194
1118	above = 0;	1195	above = 0;
1119	below = 0;	1196	below = 0;
1120		1197
		1198	ms.invalidate ();
		1199
1121	if (map->in_memory == MAP_SAVING)	1200	if (map->in_memory == MAP_SAVING)
1122	return;	1201	return;
1123		1202
1124	int check_walk_off = !flag [FLAG_NO_APPLY];	1203	int check_walk_off = !flag [FLAG_NO_APPLY];
1125		1204
1126	if (object *pl = ms.player ())	1205	if (object *pl = ms.player ())
1127	{	1206	{
1128	if (pl->container == this)	1207	if (pl->container_ () == this)
1129	/* If a container that the player is currently using somehow gets	1208	/* If a container that the player is currently using somehow gets
1130	* removed (most likely destroyed), update the player view	1209	* removed (most likely destroyed), update the player view
1131	* appropriately.	1210	* appropriately.
1132	*/	1211	*/
1133	pl->close_container ();	1212	pl->close_container ();
…		…
1137	//TODO: update floorbox to preserve ordering	1216	//TODO: update floorbox to preserve ordering
1138	if (pl->contr->ns)	1217	if (pl->contr->ns)
1139	pl->contr->ns->floorbox_update ();	1218	pl->contr->ns->floorbox_update ();
1140	}	1219	}
1141		1220
		1221	if (check_walk_off)
1142	for (tmp = ms.bot; tmp; tmp = tmp->above)	1222	for (object above, tmp = ms.bot; tmp; tmp = above)
1143	{	1223	{
		1224	above = tmp->above;
		1225
1144	/* No point updating the players look faces if he is the object	1226	/* No point updating the players look faces if he is the object
1145	* being removed.	1227	* being removed.
1146	*/	1228	*/
1147		1229
1148	/* See if object moving off should effect something */	1230	/* See if object moving off should effect something */
1149	if (check_walk_off
1150	&& ((move_type & tmp->move_off)	1231	if ((move_type & tmp->move_off)
1151	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1232	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1152	{
1153	move_apply (tmp, this, 0);	1233	move_apply (tmp, this, 0);
1154
1155	if (destroyed ())
1156	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1157	}	1234	}
1158		1235
1159	last = tmp;	1236	if (affects_los ())
1160	}
1161
1162	/* last == NULL if there are no objects on this space */
1163	//TODO: this makes little sense, why only update the topmost object?
1164	if (!last)
1165	map->at (x, y).flags_ = 0;
1166	else
1167	update_object (last, UP_OBJ_REMOVE);
1168
1169	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1170	update_all_los (map, x, y);	1237	update_all_los (map, x, y);
1171	}	1238	}
1172	}	1239	}
1173		1240
1174	/*	1241	/*
…		…
1198	esrv_update_item (UPD_NROF, pl, top);	1265	esrv_update_item (UPD_NROF, pl, top);
1199		1266
1200	op->weight = 0; // cancel the addition above	1267	op->weight = 0; // cancel the addition above
1201	op->carrying = 0; // must be 0 already	1268	op->carrying = 0; // must be 0 already
1202		1269
1203	op->destroy (1);	1270	op->destroy ();
1204		1271
1205	return top;	1272	return top;
1206	}	1273	}
1207		1274
1208	return 0;	1275	return 0;
…		…
1216		1283
1217	object *prev = this;	1284	object *prev = this;
1218		1285
1219	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)	1286	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1220	{	1287	{
1221	object *op = arch_to_object (at);	1288	object *op = at->instance ();
1222		1289
1223	op->name = name;	1290	op->name = name;
1224	op->name_pl = name_pl;	1291	op->name_pl = name_pl;
1225	op->title = title;	1292	op->title = title;
1226		1293
…		…
1236	* job preparing multi-part monsters.	1303	* job preparing multi-part monsters.
1237	*/	1304	*/
1238	object *	1305	object *
1239	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1306	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1240	{	1307	{
		1308	op->remove ();
		1309
1241	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1310	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1242	{	1311	{
1243	tmp->x = x + tmp->arch->x;	1312	tmp->x = x + tmp->arch->x;
1244	tmp->y = y + tmp->arch->y;	1313	tmp->y = y + tmp->arch->y;
1245	}	1314	}
…		…
1270	object *	1339	object *
1271	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1340	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1272	{	1341	{
1273	op->remove ();	1342	op->remove ();
1274		1343
		1344	if (m == &freed_map)//D TODO: remove soon
		1345	{//D
		1346	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1347	}//D
		1348
1275	/* Ideally, the caller figures this out. However, it complicates a lot	1349	/* Ideally, the caller figures this out. However, it complicates a lot
1276	* of areas of callers (eg, anything that uses find_free_spot would now	1350	* of areas of callers (eg, anything that uses find_free_spot would now
1277	* need extra work	1351	* need extra work
1278	*/	1352	*/
		1353	maptile *newmap = m;
1279	if (!xy_normalise (m, op->x, op->y))	1354	if (!xy_normalise (newmap, op->x, op->y))
1280	{	1355	{
1281	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1356	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1282	return 0;	1357	return 0;
1283	}	1358	}
1284		1359
1285	if (object *more = op->more)	1360	if (object *more = op->more)
1286	if (!insert_ob_in_map (more, m, originator, flag))	1361	if (!insert_ob_in_map (more, m, originator, flag))
1287	return 0;	1362	return 0;
1288		1363
1289	CLEAR_FLAG (op, FLAG_REMOVED);	1364	op->flag [FLAG_REMOVED] = false;
1290		1365	op->env = 0;
1291	op->map = m;	1366	op->map = newmap;
		1367
1292	mapspace &ms = op->ms ();	1368	mapspace &ms = op->ms ();
1293		1369
1294	/* this has to be done after we translate the coordinates.	1370	/* this has to be done after we translate the coordinates.
1295	*/	1371	*/
1296	if (op->nrof && !(flag & INS_NO_MERGE))	1372	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1299	{	1375	{
1300	// TODO: we actually want to update tmp, not op,	1376	// TODO: we actually want to update tmp, not op,
1301	// but some caller surely breaks when we return tmp	1377	// but some caller surely breaks when we return tmp
1302	// from here :/	1378	// from here :/
1303	op->nrof += tmp->nrof;	1379	op->nrof += tmp->nrof;
1304	tmp->destroy (1);	1380	tmp->destroy ();
1305	}	1381	}
1306		1382
1307	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1383	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1308	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1384	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1309		1385
…		…
1317	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1393	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1318	abort ();	1394	abort ();
1319	}	1395	}
1320		1396
1321	if (!originator->is_on_map ())	1397	if (!originator->is_on_map ())
		1398	{
1322	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",	1399	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1323	op->debug_desc (), originator->debug_desc ());	1400	op->debug_desc (), originator->debug_desc ());
		1401	abort ();
		1402	}
1324		1403
1325	op->above = originator;	1404	op->above = originator;
1326	op->below = originator->below;	1405	op->below = originator->below;
1327	originator->below = op;	1406	originator->below = op;
1328		1407
…		…
1414	op->below = top;	1493	op->below = top;
1415	*(op->above ? &op->above->below : &ms.top) = op;	1494	*(op->above ? &op->above->below : &ms.top) = op;
1416	}	1495	}
1417	}	1496	}
1418		1497
1419	if (op->type == PLAYER)	1498	if (op->is_player ())
1420	{	1499	{
1421	op->contr->do_los = 1;	1500	op->contr->do_los = 1;
1422	++op->map->players;	1501	++op->map->players;
1423	op->map->touch ();	1502	op->map->touch ();
1424	}	1503	}
…		…
1439	* be far away from this change and not affected in any way -	1518	* be far away from this change and not affected in any way -
1440	* this should get redone to only look for players within range,	1519	* this should get redone to only look for players within range,
1441	* or just updating the P_UPTODATE for spaces within this area	1520	* or just updating the P_UPTODATE for spaces within this area
1442	* of effect may be sufficient.	1521	* of effect may be sufficient.
1443	*/	1522	*/
1444	if (op->map->darkness && (op->glow_radius != 0))	1523	if (op->affects_los ())
		1524	{
		1525	op->ms ().invalidate ();
1445	update_all_los (op->map, op->x, op->y);	1526	update_all_los (op->map, op->x, op->y);
		1527	}
1446		1528
1447	/* updates flags (blocked, alive, no magic, etc) for this map space */	1529	/* updates flags (blocked, alive, no magic, etc) for this map space */
1448	update_object (op, UP_OBJ_INSERT);	1530	update_object (op, UP_OBJ_INSERT);
1449		1531
1450	INVOKE_OBJECT (INSERT, op);	1532	INVOKE_OBJECT (INSERT, op);
…		…
1457	* blocked() and wall() work properly), and these flags are updated by	1539	* blocked() and wall() work properly), and these flags are updated by
1458	* update_object().	1540	* update_object().
1459	*/	1541	*/
1460		1542
1461	/* if this is not the head or flag has been passed, don't check walk on status */	1543	/* if this is not the head or flag has been passed, don't check walk on status */
1462	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1544	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1463	{	1545	{
1464	if (check_move_on (op, originator))	1546	if (check_move_on (op, originator))
1465	return 0;	1547	return 0;
1466		1548
1467	/* If we are a multi part object, lets work our way through the check	1549	/* If we are a multi part object, lets work our way through the check
…		…
1478	/* this function inserts an object in the map, but if it	1560	/* this function inserts an object in the map, but if it
1479	* finds an object of its own type, it'll remove that one first.	1561	* finds an object of its own type, it'll remove that one first.
1480	* op is the object to insert it under: supplies x and the map.	1562	* op is the object to insert it under: supplies x and the map.
1481	*/	1563	*/
1482	void	1564	void
1483	replace_insert_ob_in_map (const char arch_string, object op)	1565	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1484	{	1566	{
1485	/* first search for itself and remove any old instances */	1567	/* first search for itself and remove any old instances */
1486		1568
1487	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1569	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1488	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1570	if (tmp->arch->archname == archname) /* same archetype */
1489	tmp->destroy (1);	1571	tmp->destroy ();
1490		1572
1491	object *tmp = arch_to_object (archetype::find (arch_string));	1573	object *tmp = archetype::find (archname)->instance ();
1492		1574
1493	tmp->x = op->x;	1575	tmp->x = op->x;
1494	tmp->y = op->y;	1576	tmp->y = op->y;
1495		1577
1496	insert_ob_in_map (tmp, op->map, op, 0);	1578	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1501	{	1583	{
1502	if (where->env)	1584	if (where->env)
1503	return where->env->insert (this);	1585	return where->env->insert (this);
1504	else	1586	else
1505	return where->map->insert (this, where->x, where->y, originator, flags);	1587	return where->map->insert (this, where->x, where->y, originator, flags);
		1588	}
		1589
		1590	// check whether we can put this into the map, respect max_volume, max_items
		1591	bool
		1592	object::can_drop_at (maptile m, int x, int y, object originator)
		1593	{
		1594	mapspace &ms = m->at (x, y);
		1595
		1596	int items = ms.items ();
		1597
		1598	if (!items // testing !items ensures we can drop at least one item
		1599	\|\| (items < m->max_items
		1600	&& ms.volume () < m->max_volume))
		1601	return true;
		1602
		1603	if (originator && originator->is_player ())
		1604	originator->contr->failmsg (format (
		1605	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1606	query_name ()
		1607	));
		1608
		1609	return false;
1506	}	1610	}
1507		1611
1508	/*	1612	/*
1509	* decrease(object, number) decreases a specified number from	1613	* decrease(object, number) decreases a specified number from
1510	* the amount of an object. If the amount reaches 0, the object	1614	* the amount of an object. If the amount reaches 0, the object
…		…
1518	if (!nr)	1622	if (!nr)
1519	return true;	1623	return true;
1520		1624
1521	nr = min (nr, nrof);	1625	nr = min (nr, nrof);
1522		1626
		1627	if (nrof > nr)
		1628	{
1523	nrof -= nr;	1629	nrof -= nr;
1524
1525	if (nrof)
1526	{
1527	adjust_weight (env, -weight * nr); // carrying == 0	1630	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1528		1631
1529	if (object *pl = visible_to ())	1632	if (object *pl = visible_to ())
1530	esrv_update_item (UPD_NROF, pl, this);	1633	esrv_update_item (UPD_NROF, pl, this);
1531		1634
1532	return true;	1635	return true;
1533	}	1636	}
1534	else	1637	else
1535	{	1638	{
1536	destroy (1);	1639	destroy ();
1537	return false;	1640	return false;
1538	}	1641	}
1539	}	1642	}
1540		1643
1541	/*	1644	/*
…		…
1618	if (object *pl = tmp->visible_to ())	1721	if (object *pl = tmp->visible_to ())
1619	esrv_update_item (UPD_NROF, pl, tmp);	1722	esrv_update_item (UPD_NROF, pl, tmp);
1620		1723
1621	adjust_weight (this, op->total_weight ());	1724	adjust_weight (this, op->total_weight ());
1622		1725
1623	op->destroy (1);	1726	op->destroy ();
1624	op = tmp;	1727	op = tmp;
1625	goto inserted;	1728	goto inserted;
1626	}	1729	}
1627		1730
1628	op->owner = 0; // it's his/hers now. period.	1731	op->owner = 0; // it's his/hers now. period.
…		…
1646		1749
1647	adjust_weight (this, op->total_weight ());	1750	adjust_weight (this, op->total_weight ());
1648		1751
1649	inserted:	1752	inserted:
1650	/* reset the light list and los of the players on the map */	1753	/* reset the light list and los of the players on the map */
1651	if (op->glow_radius && map && map->darkness)	1754	if (op->glow_radius && is_on_map ())
		1755	{
		1756	update_stats ();
1652	update_all_los (map, x, y);	1757	update_all_los (map, x, y);
1653		1758	}
		1759	else if (is_player ())
1654	// if this is a player's inventory, update stats	1760	// if this is a player's inventory, update stats
1655	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1761	contr->queue_stats_update ();
1656	update_stats ();
1657		1762
1658	INVOKE_OBJECT (INSERT, this);	1763	INVOKE_OBJECT (INSERT, this);
1659		1764
1660	return op;	1765	return op;
1661	}	1766	}
…		…
1681	* on top.	1786	* on top.
1682	*/	1787	*/
1683	int	1788	int
1684	check_move_on (object op, object originator)	1789	check_move_on (object op, object originator)
1685	{	1790	{
		1791	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1792	return 0;
		1793
1686	object *tmp;	1794	object *tmp;
1687	maptile *m = op->map;	1795	maptile *m = op->map;
1688	int x = op->x, y = op->y;	1796	int x = op->x, y = op->y;
1689		1797
1690	MoveType move_on, move_slow, move_block;	1798	mapspace &ms = m->at (x, y);
1691		1799
1692	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1800	ms.update ();
1693	return 0;
1694		1801
1695	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1802	MoveType move_on = ms.move_on;
1696	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1803	MoveType move_slow = ms.move_slow;
1697	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1804	MoveType move_block = ms.move_block;
1698		1805
1699	/* if nothing on this space will slow op down or be applied,	1806	/* if nothing on this space will slow op down or be applied,
1700	* no need to do checking below. have to make sure move_type	1807	* no need to do checking below. have to make sure move_type
1701	* is set, as lots of objects don't have it set - we treat that	1808	* is set, as lots of objects don't have it set - we treat that
1702	* as walking.	1809	* as walking.
…		…
1713	return 0;	1820	return 0;
1714		1821
1715	/* The objects have to be checked from top to bottom.	1822	/* The objects have to be checked from top to bottom.
1716	* Hence, we first go to the top:	1823	* Hence, we first go to the top:
1717	*/	1824	*/
1718		1825	for (object next, tmp = ms.top; tmp; tmp = next)
1719	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1720	{
1721	/* Trim the search when we find the first other spell effect
1722	* this helps performance so that if a space has 50 spell objects,
1723	* we don't need to check all of them.
1724	*/
1725	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1726	break;
1727	}	1826	{
		1827	next = tmp->below;
1728		1828
1729	for (; tmp; tmp = tmp->below)
1730	{
1731	if (tmp == op)	1829	if (tmp == op)
1732	continue; /* Can't apply yourself */	1830	continue; /* Can't apply yourself */
1733		1831
1734	/* Check to see if one of the movement types should be slowed down.	1832	/* Check to see if one of the movement types should be slowed down.
1735	* Second check makes sure that the movement types not being slowed	1833	* Second check makes sure that the movement types not being slowed
…		…
1740	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1838	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1741	{	1839	{
1742	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1840	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1743	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1841	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1744	{	1842	{
1745
1746	float
1747	diff = tmp->move_slow_penalty * fabs (op->speed);	1843	float diff = tmp->move_slow_penalty * fabs (op->speed);
1748		1844
1749	if (op->type == PLAYER)	1845	if (op->is_player ())
1750	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1846	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) \|\|
1751	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1847	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1752	diff /= 4.0;	1848	diff /= 4.0;
1753		1849
1754	op->speed_left -= diff;	1850	op->speed_left -= diff;
1755	}	1851	}
1756	}	1852	}
…		…
1962	* head of the object should correspond for the entire object.	2058	* head of the object should correspond for the entire object.
1963	*/	2059	*/
1964	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2060	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1965	continue;	2061	continue;
1966		2062
1967	if (ob->blocked (m, pos.x, pos.y))	2063	if (ob->blocked (pos.m, pos.x, pos.y))
1968	continue;	2064	continue;
1969		2065
1970	altern [index++] = i;	2066	altern [index++] = i;
1971	}	2067	}
1972		2068
…		…
2040	* there is capable of.	2136	* there is capable of.
2041	*/	2137	*/
2042	int	2138	int
2043	find_dir (maptile m, int x, int y, object exclude)	2139	find_dir (maptile m, int x, int y, object exclude)
2044	{	2140	{
2045	int i, max = SIZEOFFREE, mflags;	2141	int max = SIZEOFFREE, mflags;
2046
2047	sint16 nx, ny;
2048	object *tmp;
2049	maptile *mp;
2050
2051	MoveType blocked, move_type;	2142	MoveType move_type;
2052		2143
2053	if (exclude && exclude->head_ () != exclude)	2144	if (exclude && exclude->head_ () != exclude)
2054	{	2145	{
2055	exclude = exclude->head;	2146	exclude = exclude->head;
2056	move_type = exclude->move_type;	2147	move_type = exclude->move_type;
…		…
2059	{	2150	{
2060	/* If we don't have anything, presume it can use all movement types. */	2151	/* If we don't have anything, presume it can use all movement types. */
2061	move_type = MOVE_ALL;	2152	move_type = MOVE_ALL;
2062	}	2153	}
2063		2154
2064	for (i = 1; i < max; i++)	2155	for (int i = 1; i < max; i++)
2065	{	2156	{
2066	mp = m;	2157	mapxy pos (m, x, y);
2067	nx = x + freearr_x[i];	2158	pos.move (i);
2068	ny = y + freearr_y[i];
2069		2159
2070	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2160	if (!pos.normalise ())
2071
2072	if (mflags & P_OUT_OF_MAP)
2073	max = maxfree[i];	2161	max = maxfree[i];
2074	else	2162	else
2075	{	2163	{
2076	mapspace &ms = mp->at (nx, ny);	2164	mapspace &ms = *pos;
2077		2165
2078	blocked = ms.move_block;
2079
2080	if ((move_type & blocked) == move_type)	2166	if ((move_type & ms.move_block) == move_type)
2081	max = maxfree[i];	2167	max = maxfree [i];
2082	else if (mflags & P_IS_ALIVE)	2168	else if (ms.flags () & P_IS_ALIVE)
2083	{	2169	{
2084	for (tmp = ms.bot; tmp; tmp = tmp->above)	2170	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2085	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2171	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2086	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2172	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2087	break;
2088
2089	if (tmp)
2090	return freedir[i];	2173	return freedir [i];
2091	}	2174	}
2092	}	2175	}
2093	}	2176	}
2094		2177
2095	return 0;	2178	return 0;
…		…
2170	* This basically means that if direction is 15, then it could either go	2253	* This basically means that if direction is 15, then it could either go
2171	* direction 4, 14, or 16 to get back to where we are.	2254	* direction 4, 14, or 16 to get back to where we are.
2172	* Moved from spell_util.c to object.c with the other related direction	2255	* Moved from spell_util.c to object.c with the other related direction
2173	* functions.	2256	* functions.
2174	*/	2257	*/
2175	int reduction_dir[SIZEOFFREE][3] = {	2258	static const int reduction_dir[SIZEOFFREE][3] = {
2176	{0, 0, 0}, /* 0 */	2259	{0, 0, 0}, /* 0 */
2177	{0, 0, 0}, /* 1 */	2260	{0, 0, 0}, /* 1 */
2178	{0, 0, 0}, /* 2 */	2261	{0, 0, 0}, /* 2 */
2179	{0, 0, 0}, /* 3 */	2262	{0, 0, 0}, /* 3 */
2180	{0, 0, 0}, /* 4 */	2263	{0, 0, 0}, /* 4 */
…		…
2276	int	2359	int
2277	can_pick (const object who, const object item)	2360	can_pick (const object who, const object item)
2278	{	2361	{
2279	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2362	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2280	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2363	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2281	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER \|\| item->weight < who->weight / 3));	2364	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2282	}	2365	}
2283		2366
2284	/*	2367	/*
2285	* create clone from object to another	2368	* create clone from object to another
2286	*/	2369	*/
…		…
2318	return tmp;	2401	return tmp;
2319		2402
2320	return 0;	2403	return 0;
2321	}	2404	}
2322		2405
2323	const shstr &	2406	shstr_tmp
2324	object::kv_get (const shstr &key) const	2407	object::kv_get (shstr_tmp key) const
2325	{	2408	{
2326	for (key_value *kv = key_values; kv; kv = kv->next)	2409	for (key_value *kv = key_values; kv; kv = kv->next)
2327	if (kv->key == key)	2410	if (kv->key == key)
2328	return kv->value;	2411	return kv->value;
2329		2412
2330	return shstr_null;	2413	return shstr ();
2331	}	2414	}
2332		2415
2333	void	2416	void
2334	object::kv_set (const shstr &key, const shstr &value)	2417	object::kv_set (shstr_tmp key, shstr_tmp value)
2335	{	2418	{
2336	for (key_value *kv = key_values; kv; kv = kv->next)	2419	for (key_value *kv = key_values; kv; kv = kv->next)
2337	if (kv->key == key)	2420	if (kv->key == key)
2338	{	2421	{
2339	kv->value = value;	2422	kv->value = value;
…		…
2348		2431
2349	key_values = kv;	2432	key_values = kv;
2350	}	2433	}
2351		2434
2352	void	2435	void
2353	object::kv_del (const shstr &key)	2436	object::kv_del (shstr_tmp key)
2354	{	2437	{
2355	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2438	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2356	if ((*kvp)->key == key)	2439	if ((*kvp)->key == key)
2357	{	2440	{
2358	key_value kv = kvp;	2441	key_value kv = kvp;
…		…
2417	{	2500	{
2418	char flagdesc[512];	2501	char flagdesc[512];
2419	char info2[256 * 4];	2502	char info2[256 * 4];
2420	char *p = info;	2503	char *p = info;
2421		2504
2422	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2505	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2423	count,	2506	count,
2424	uuid.c_str (),	2507	uuid.c_str (),
2425	&name,	2508	&name,
2426	title ? "\",title:\"" : "",	2509	title ? ",title:\"" : "",
2427	title ? (const char *)title : "",	2510	title ? (const char *)title : "",
		2511	title ? "\"" : "",
2428	flag_desc (flagdesc, 512), type);	2512	flag_desc (flagdesc, 512), type);
2429		2513
2430	if (!flag[FLAG_REMOVED] && env)	2514	if (!flag[FLAG_REMOVED] && env)
2431	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2515	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2432		2516
…		…
2448	struct region *	2532	struct region *
2449	object::region () const	2533	object::region () const
2450	{	2534	{
2451	return map ? map->region (x, y)	2535	return map ? map->region (x, y)
2452	: region::default_region ();	2536	: region::default_region ();
2453	}
2454
2455	const materialtype_t *
2456	object::dominant_material () const
2457	{
2458	if (materialtype_t *mt = name_to_material (materialname))
2459	return mt;
2460
2461	return name_to_material (shstr_unknown);
2462	}	2537	}
2463		2538
2464	void	2539	void
2465	object::open_container (object *new_container)	2540	object::open_container (object *new_container)
2466	{	2541	{
…		…
2488	container = 0;	2563	container = 0;
2489		2564
2490	// client needs item update to make it work, client bug requires this to be separate	2565	// client needs item update to make it work, client bug requires this to be separate
2491	esrv_update_item (UPD_FLAGS, this, old_container);	2566	esrv_update_item (UPD_FLAGS, this, old_container);
2492		2567
2493	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2568	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2494	play_sound (sound_find ("chest_close"));	2569	play_sound (sound_find ("chest_close"));
2495	}	2570	}
2496		2571
2497	if (new_container)	2572	if (new_container)
2498	{	2573	{
…		…
2502	// TODO: this does not seem to serve any purpose anymore?	2577	// TODO: this does not seem to serve any purpose anymore?
2503	#if 0	2578	#if 0
2504	// insert the "Close Container" object.	2579	// insert the "Close Container" object.
2505	if (archetype *closer = new_container->other_arch)	2580	if (archetype *closer = new_container->other_arch)
2506	{	2581	{
2507	object *closer = arch_to_object (new_container->other_arch);	2582	object *closer = new_container->other_arch->instance ();
2508	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2583	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2509	new_container->insert (closer);	2584	new_container->insert (closer);
2510	}	2585	}
2511	#endif	2586	#endif
2512		2587
2513	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2588	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2514		2589
2515	// make sure the container is available, client bug requires this to be separate	2590	// make sure the container is available, client bug requires this to be separate
2516	esrv_send_item (this, new_container);	2591	esrv_send_item (this, new_container);
2517		2592
2518	new_container->flag [FLAG_APPLIED] = true;	2593	new_container->flag [FLAG_APPLIED] = true;
…		…
2526	// else if (!old_container->env && contr && contr->ns)	2601	// else if (!old_container->env && contr && contr->ns)
2527	// contr->ns->floorbox_reset ();	2602	// contr->ns->floorbox_reset ();
2528	}	2603	}
2529		2604
2530	object *	2605	object *
2531	object::force_find (const shstr name)	2606	object::force_find (shstr_tmp name)
2532	{	2607	{
2533	/* cycle through his inventory to look for the MARK we want to	2608	/* cycle through his inventory to look for the MARK we want to
2534	* place	2609	* place
2535	*/	2610	*/
2536	for (object *tmp = inv; tmp; tmp = tmp->below)	2611	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2538	return splay (tmp);	2613	return splay (tmp);
2539		2614
2540	return 0;	2615	return 0;
2541	}	2616	}
2542		2617
		2618	//-GPL
		2619
2543	void	2620	void
		2621	object::force_set_timer (int duration)
		2622	{
		2623	this->duration = 1;
		2624	this->speed_left = -1.f;
		2625
		2626	this->set_speed (duration ? 1.f / duration : 0.f);
		2627	}
		2628
		2629	object *
2544	object::force_add (const shstr name, int duration)	2630	object::force_add (shstr_tmp name, int duration)
2545	{	2631	{
2546	if (object *force = force_find (name))	2632	if (object *force = force_find (name))
2547	force->destroy ();	2633	force->destroy ();
2548		2634
2549	object *force = get_archetype (FORCE_NAME);	2635	object *force = get_archetype (FORCE_NAME);
2550		2636
2551	force->slaying = name;	2637	force->slaying = name;
2552	force->stats.food = 1;	2638	force->force_set_timer (duration);
2553	force->speed_left = -1.f;
2554
2555	force->set_speed (duration ? 1.f / duration : 0.f);
2556	force->flag [FLAG_IS_USED_UP] = true;
2557	force->flag [FLAG_APPLIED] = true;	2639	force->flag [FLAG_APPLIED] = true;
2558		2640
2559	insert (force);	2641	return insert (force);
2560	}	2642	}
2561		2643
2562	void	2644	void
2563	object::play_sound (faceidx sound)	2645	object::play_sound (faceidx sound) const
2564	{	2646	{
2565	if (!sound)	2647	if (!sound)
2566	return;	2648	return;
2567		2649
2568	if (flag [FLAG_REMOVED])	2650	if (is_on_map ())
		2651	map->play_sound (sound, x, y);
		2652	else if (object *pl = in_player ())
		2653	pl->contr->play_sound (sound);
		2654	}
		2655
		2656	void
		2657	object::say_msg (const char *msg) const
		2658	{
		2659	if (is_on_map ())
		2660	map->say_msg (msg, x, y);
		2661	else if (object *pl = in_player ())
		2662	pl->contr->play_sound (sound);
		2663	}
		2664
		2665	void
		2666	object::make_noise ()
		2667	{
		2668	// we do not model noise in the map, so instead put
		2669	// a temporary light into the noise source
		2670	// could use the map instead, but that's less reliable for our
		2671	// goal, which is to make invisibility a bit harder to exploit
		2672
		2673	// currently only works sensibly for players
		2674	if (!is_player ())
2569	return;	2675	return;
2570		2676
2571	if (env)	2677	// find old force, or create new one
2572	{	2678	object *force = force_find (shstr_noise_force);
2573	if (object *pl = in_player ())	2679
2574	pl->contr->play_sound (sound);	2680	if (force)
2575	}	2681	force->speed_left = -1.f; // patch old speed up
2576	else	2682	else
2577	map->play_sound (sound, x, y);	2683	{
2578	}	2684	force = archetype::get (shstr_noise_force);
2579		2685
		2686	force->slaying = shstr_noise_force;
		2687	force->stats.food = 1;
		2688	force->speed_left = -1.f;
		2689
		2690	force->set_speed (1.f / 4.f);
		2691	force->flag [FLAG_IS_USED_UP] = true;
		2692	force->flag [FLAG_APPLIED] = true;
		2693
		2694	insert (force);
		2695	}
		2696	}
		2697

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.241 by root, Wed May 7 19:19:09 2008 UTC vs. Revision 1.312 by elmex, Sat Mar 20 00:42:08 2010 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.241 by root, Wed May 7 19:19:09 2008 UTC vs.
Revision 1.312 by elmex, Sat Mar 20 00:42:08 2010 UTC