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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.237 by root, Tue May 6 21:04:37 2008 UTC vs.
Revision 1.311 by root, Sat Jan 16 13:41:37 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.
…		…
478	*/	528	*/
479	object *	529	object *
480	find_object_name (const char *str)	530	find_object_name (const char *str)
481	{	531	{
482	shstr_cmp str_ (str);	532	shstr_cmp str_ (str);
483	object *op;
484		533
		534	if (str_)
485	for_all_objects (op)	535	for_all_objects (op)
486	if (op->name == str_)	536	if (op->name == str_)
487	break;	537	return op;
488		538
489	return op;	539	return 0;
490	}	540	}
491		541
492	/*	542	/*
493	* Sets the owner and sets the skill and exp pointers to owner's current	543	* Sets the owner and sets the skill and exp pointers to owner's current
494	* skill and experience objects.	544	* skill and experience objects.
…		…
556	update_stats ();	606	update_stats ();
557		607
558	new_draw_info_format (NDI_UNIQUE, 0, this,	608	new_draw_info_format (NDI_UNIQUE, 0, this,
559	"You try to balance all your items at once, "	609	"You try to balance all your items at once, "
560	"but the %s is just too much for your body. "	610	"but the %s is just too much for your body. "
561	"[You need to unapply some items first.]", &ob->name);	611	"[You need to unapply some items first - use the 'body' command to see "
		612	"how many items you cna wera on a specific body part.]", &ob->name);
562	return false;	613	return false;
563	}	614	}
564		615
565	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	616	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
566	}	617	}
…		…
635	tail = new_link;	686	tail = new_link;
636	}	687	}
637	}	688	}
638	}	689	}
639		690
640	if (speed < 0)	691	dst->activate ();
641	dst->speed_left -= rndm ();
642
643	dst->set_speed (dst->speed);
644	}	692	}
645		693
646	void	694	void
647	object::instantiate ()	695	object::instantiate ()
648	{	696	{
649	if (!uuid.seq) // HACK	697	if (!uuid.seq) // HACK
650	uuid = UUID::gen ();	698	uuid = UUID::gen ();
651		699
		700	// TODO: unclean state changes, should nt be done in copy_to AND instantiate
		701	if (flag [FLAG_RANDOM_SPEED] && speed)
		702	speed_left = - speed - rndm (); // TODO animation
		703	else
652	speed_left = -0.1f;	704	speed_left = -1.;
		705
653	/* copy the body_info to the body_used - this is only really	706	/* 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.	707	* 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	708	* by doing so, when a monster is created, it has good starting
656	* values for the body_used info, so when items are created	709	* values for the body_used info, so when items are created
657	* for it, they can be properly equipped.	710	* for it, they can be properly equipped.
…		…
665	object *	718	object *
666	object::clone ()	719	object::clone ()
667	{	720	{
668	object *neu = create ();	721	object *neu = create ();
669	copy_to (neu);	722	copy_to (neu);
		723
		724	// TODO: unclean state changes, should not be done in clone AND instantiate
		725	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		726	neu->speed_left = - neu->speed - rndm (); // TODO animation
		727
670	neu->map = map; // not copied by copy_to	728	neu->map = map; // not copied by copy_to
671	return neu;	729	return neu;
672	}	730	}
673		731
674	/*	732	/*
…		…
692	* This function needs to be called whenever the speed of an object changes.	750	* This function needs to be called whenever the speed of an object changes.
693	*/	751	*/
694	void	752	void
695	object::set_speed (float speed)	753	object::set_speed (float speed)
696	{	754	{
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;	755	this->speed = speed;
704		756
705	if (has_active_speed ())	757	if (has_active_speed ())
706	activate ();	758	activate ();
707	else	759	else
…		…
757		809
758	if (!(m.flags_ & P_UPTODATE))	810	if (!(m.flags_ & P_UPTODATE))
759	/* nop */;	811	/* nop */;
760	else if (action == UP_OBJ_INSERT)	812	else if (action == UP_OBJ_INSERT)
761	{	813	{
		814	#if 0
762	// this is likely overkill, TODO: revisit (schmorp)	815	// this is likely overkill, TODO: revisit (schmorp)
763	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	816	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
764	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	817	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
765	\|\| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	818	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
766	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	819	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
767	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	820	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
768	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	821	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
769	\|\| (m.move_on \| op->move_on ) != m.move_on	822	\|\| (m.move_on \| op->move_on ) != m.move_on
770	\|\| (m.move_off \| op->move_off ) != m.move_off	823	\|\| (m.move_off \| op->move_off ) != m.move_off
771	\|\| (m.move_slow \| op->move_slow) != m.move_slow	824	\|\| (m.move_slow \| op->move_slow) != m.move_slow
772	/* This isn't perfect, but I don't expect a lot of objects to	825	/* This isn't perfect, but I don't expect a lot of objects to
773	* to have move_allow right now.	826	* have move_allow right now.
774	*/	827	*/
775	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block	828	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block
		829	m.invalidate ();
		830	#else
776	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	831	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
777	m.flags_ = 0;	832	m.invalidate ();
		833	#endif
778	}	834	}
779	/* if the object is being removed, we can't make intelligent	835	/* if the object is being removed, we can't make intelligent
780	* decisions, because remove_ob can't really pass the object	836	* decisions, because remove_ob can't really pass the object
781	* that is being removed.	837	* that is being removed.
782	*/	838	*/
783	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	839	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
784	m.flags_ = 0;	840	m.invalidate ();
785	else if (action == UP_OBJ_FACE)	841	else if (action == UP_OBJ_FACE)
786	/* Nothing to do for that case */ ;	842	/* Nothing to do for that case */ ;
787	else	843	else
788	LOG (llevError, "update_object called with invalid action: %d\n", action);	844	LOG (llevError, "update_object called with invalid action: %d\n", action);
789		845
…		…
793		849
794	object::object ()	850	object::object ()
795	{	851	{
796	SET_FLAG (this, FLAG_REMOVED);	852	SET_FLAG (this, FLAG_REMOVED);
797		853
798	expmul = 1.0;	854	//expmul = 1.0; declared const for the time being
799	face = blank_face;	855	face = blank_face;
		856	material = MATERIAL_NULL;
800	}	857	}
801		858
802	object::~object ()	859	object::~object ()
803	{	860	{
804	unlink ();	861	unlink ();
…		…
833	/* If already on active list, don't do anything */	890	/* If already on active list, don't do anything */
834	if (active)	891	if (active)
835	return;	892	return;
836		893
837	if (has_active_speed ())	894	if (has_active_speed ())
		895	{
		896	if (flag [FLAG_FREED])
		897	LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		898
838	actives.insert (this);	899	actives.insert (this);
		900	}
839	}	901	}
840		902
841	void	903	void
842	object::activate_recursive ()	904	object::activate_recursive ()
843	{	905	{
…		…
904	* drop on that space.	966	* drop on that space.
905	*/	967	*/
906	if (!drop_to_ground	968	if (!drop_to_ground
907	\|\| !map	969	\|\| !map
908	\|\| map->in_memory != MAP_ACTIVE	970	\|\| map->in_memory != MAP_ACTIVE
909	\|\| map->nodrop	971	\|\| map->no_drop
910	\|\| ms ().move_block == MOVE_ALL)	972	\|\| ms ().move_block == MOVE_ALL)
911	{	973	{
912	while (inv)	974	while (inv)
913	{
914	inv->destroy_inv (false);
915	inv->destroy ();	975	inv->destroy ();
916	}
917	}	976	}
918	else	977	else
919	{ /* Put objects in inventory onto this space */	978	{ /* Put objects in inventory onto this space */
920	while (inv)	979	while (inv)
921	{	980	{
…		…
925	\|\| op->flag [FLAG_NO_DROP]	984	\|\| op->flag [FLAG_NO_DROP]
926	\|\| op->type == RUNE	985	\|\| op->type == RUNE
927	\|\| op->type == TRAP	986	\|\| op->type == TRAP
928	\|\| op->flag [FLAG_IS_A_TEMPLATE]	987	\|\| op->flag [FLAG_IS_A_TEMPLATE]
929	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	988	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
930	op->destroy (true);	989	op->destroy ();
931	else	990	else
932	map->insert (op, x, y);	991	map->insert (op, x, y);
933	}	992	}
934	}	993	}
935	}	994	}
…		…
943		1002
944	static struct freed_map : maptile	1003	static struct freed_map : maptile
945	{	1004	{
946	freed_map ()	1005	freed_map ()
947	{	1006	{
948	path = "<freed objects map>";	1007	path = "<freed objects map>";
949	name = "/internal/freed_objects_map";	1008	name = "/internal/freed_objects_map";
950	width = 3;	1009	width = 3;
951	height = 3;	1010	height = 3;
952	nodrop = 1;	1011	no_drop = 1;
		1012	no_reset = 1;
953		1013
954	alloc ();	1014	alloc ();
955	in_memory = MAP_ACTIVE;	1015	in_memory = MAP_ACTIVE;
956	}	1016	}
957		1017
…		…
963		1023
964	void	1024	void
965	object::do_destroy ()	1025	object::do_destroy ()
966	{	1026	{
967	if (flag [FLAG_IS_LINKED])	1027	if (flag [FLAG_IS_LINKED])
968	remove_button_link (this);	1028	remove_link ();
969		1029
970	if (flag [FLAG_FRIENDLY])	1030	if (flag [FLAG_FRIENDLY])
971	remove_friendly_object (this);	1031	remove_friendly_object (this);
972		1032
973	remove ();	1033	remove ();
…		…
998	attacked_by = 0;	1058	attacked_by = 0;
999	current_weapon = 0;	1059	current_weapon = 0;
1000	}	1060	}
1001		1061
1002	void	1062	void
1003	object::destroy (bool destroy_inventory)	1063	object::destroy ()
1004	{	1064	{
1005	if (destroyed ())	1065	if (destroyed ())
1006	return;	1066	return;
1007		1067
1008	if (!is_head () && !head->destroyed ())	1068	if (!is_head () && !head->destroyed ())
1009	{	1069	{
1010	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1070	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1011	head->destroy (destroy_inventory);	1071	head->destroy ();
1012	return;	1072	return;
1013	}	1073	}
1014		1074
1015	destroy_inv (!destroy_inventory);	1075	destroy_inv (false);
1016		1076
1017	if (is_head ())	1077	if (is_head ())
1018	if (sound_destroy)	1078	if (sound_destroy)
1019	play_sound (sound_destroy);	1079	play_sound (sound_destroy);
1020	else if (flag [FLAG_MONSTER])	1080	else if (flag [FLAG_MONSTER])
…		…
1031	* the previous environment.	1091	* the previous environment.
1032	*/	1092	*/
1033	void	1093	void
1034	object::do_remove ()	1094	object::do_remove ()
1035	{	1095	{
1036	object tmp, last = 0;
1037	object *otmp;
1038
1039	if (flag [FLAG_REMOVED])	1096	if (flag [FLAG_REMOVED])
1040	return;	1097	return;
1041		1098
1042	INVOKE_OBJECT (REMOVE, this);	1099	INVOKE_OBJECT (REMOVE, this);
1043		1100
…		…
1056	if (object *pl = visible_to ())	1113	if (object *pl = visible_to ())
1057	esrv_del_item (pl->contr, count);	1114	esrv_del_item (pl->contr, count);
1058	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1115	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1059		1116
1060	adjust_weight (env, -total_weight ());	1117	adjust_weight (env, -total_weight ());
		1118
		1119	object *pl = in_player ();
1061		1120
1062	/* we set up values so that it could be inserted into	1121	/* we set up values so that it could be inserted into
1063	* the map, but we don't actually do that - it is up	1122	* the map, but we don't actually do that - it is up
1064	* to the caller to decide what we want to do.	1123	* to the caller to decide what we want to do.
1065	*/	1124	*/
…		…
1073		1132
1074	above = 0;	1133	above = 0;
1075	below = 0;	1134	below = 0;
1076	env = 0;	1135	env = 0;
1077		1136
1078	/* NO_FIX_PLAYER is set when a great many changes are being	1137	if (pl && pl->is_player ())
1079	* made to players inventory. If set, avoiding the call
1080	* to save cpu time.
1081	*/	1138	{
1082	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1139	pl->contr->queue_stats_update ();
1083	otmp->update_stats ();	1140
		1141	if (glow_radius && pl->is_on_map ())
		1142	update_all_los (pl->map, pl->x, pl->y);
		1143	}
1084	}	1144	}
1085	else if (map)	1145	else if (map)
1086	{	1146	{
1087	map->dirty = true;	1147	map->dirty = true;
1088	mapspace &ms = this->ms ();	1148	mapspace &ms = this->ms ();
1089		1149
1090	if (object *pl = ms.player ())	1150	if (object *pl = ms.player ())
1091	{	1151	{
1092	if (type == PLAYER) // this == pl(!)	1152	if (is_player ())
1093	{	1153	{
		1154	if (!flag [FLAG_WIZPASS])
		1155	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1156
1094	// leaving a spot always closes any open container on the ground	1157	// leaving a spot always closes any open container on the ground
1095	if (container && !container->env)	1158	if (container && !container->env)
1096	// this causes spurious floorbox updates, but it ensures	1159	// this causes spurious floorbox updates, but it ensures
1097	// that the CLOSE event is being sent.	1160	// that the CLOSE event is being sent.
1098	close_container ();	1161	close_container ();
1099		1162
1100	--map->players;	1163	--map->players;
1101	map->touch ();	1164	map->touch ();
1102	}	1165	}
1103	else if (pl->container == this)	1166	else if (pl->container_ () == this)
1104	{	1167	{
1105	// removing a container should close it	1168	// removing a container should close it
1106	close_container ();	1169	close_container ();
1107	}	1170	}
1108		1171
…		…
1115	*(below ? &below->above : &ms.bot) = above;	1178	*(below ? &below->above : &ms.bot) = above;
1116		1179
1117	above = 0;	1180	above = 0;
1118	below = 0;	1181	below = 0;
1119		1182
		1183	ms.invalidate ();
		1184
1120	if (map->in_memory == MAP_SAVING)	1185	if (map->in_memory == MAP_SAVING)
1121	return;	1186	return;
1122		1187
1123	int check_walk_off = !flag [FLAG_NO_APPLY];	1188	int check_walk_off = !flag [FLAG_NO_APPLY];
1124		1189
1125	if (object *pl = ms.player ())	1190	if (object *pl = ms.player ())
1126	{	1191	{
1127	if (pl->container == this)	1192	if (pl->container_ () == this)
1128	/* If a container that the player is currently using somehow gets	1193	/* If a container that the player is currently using somehow gets
1129	* removed (most likely destroyed), update the player view	1194	* removed (most likely destroyed), update the player view
1130	* appropriately.	1195	* appropriately.
1131	*/	1196	*/
1132	pl->close_container ();	1197	pl->close_container ();
…		…
1136	//TODO: update floorbox to preserve ordering	1201	//TODO: update floorbox to preserve ordering
1137	if (pl->contr->ns)	1202	if (pl->contr->ns)
1138	pl->contr->ns->floorbox_update ();	1203	pl->contr->ns->floorbox_update ();
1139	}	1204	}
1140		1205
		1206	if (check_walk_off)
1141	for (tmp = ms.bot; tmp; tmp = tmp->above)	1207	for (object above, tmp = ms.bot; tmp; tmp = above)
1142	{	1208	{
		1209	above = tmp->above;
		1210
1143	/* No point updating the players look faces if he is the object	1211	/* No point updating the players look faces if he is the object
1144	* being removed.	1212	* being removed.
1145	*/	1213	*/
1146		1214
1147	/* See if object moving off should effect something */	1215	/* See if object moving off should effect something */
1148	if (check_walk_off
1149	&& ((move_type & tmp->move_off)	1216	if ((move_type & tmp->move_off)
1150	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1217	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1151	{
1152	move_apply (tmp, this, 0);	1218	move_apply (tmp, this, 0);
1153
1154	if (destroyed ())
1155	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1156	}	1219	}
1157		1220
1158	last = tmp;	1221	if (affects_los ())
1159	}
1160
1161	/* last == NULL if there are no objects on this space */
1162	//TODO: this makes little sense, why only update the topmost object?
1163	if (!last)
1164	map->at (x, y).flags_ = 0;
1165	else
1166	update_object (last, UP_OBJ_REMOVE);
1167
1168	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1169	update_all_los (map, x, y);	1222	update_all_los (map, x, y);
1170	}	1223	}
1171	}	1224	}
1172		1225
1173	/*	1226	/*
…		…
1197	esrv_update_item (UPD_NROF, pl, top);	1250	esrv_update_item (UPD_NROF, pl, top);
1198		1251
1199	op->weight = 0; // cancel the addition above	1252	op->weight = 0; // cancel the addition above
1200	op->carrying = 0; // must be 0 already	1253	op->carrying = 0; // must be 0 already
1201		1254
1202	op->destroy (1);	1255	op->destroy ();
1203		1256
1204	return top;	1257	return top;
1205	}	1258	}
1206		1259
1207	return 0;	1260	return 0;
…		…
1215		1268
1216	object *prev = this;	1269	object *prev = this;
1217		1270
1218	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)	1271	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1219	{	1272	{
1220	object *op = arch_to_object (at);	1273	object *op = at->instance ();
1221		1274
1222	op->name = name;	1275	op->name = name;
1223	op->name_pl = name_pl;	1276	op->name_pl = name_pl;
1224	op->title = title;	1277	op->title = title;
1225		1278
…		…
1235	* job preparing multi-part monsters.	1288	* job preparing multi-part monsters.
1236	*/	1289	*/
1237	object *	1290	object *
1238	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1291	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1239	{	1292	{
		1293	op->remove ();
		1294
1240	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1295	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1241	{	1296	{
1242	tmp->x = x + tmp->arch->x;	1297	tmp->x = x + tmp->arch->x;
1243	tmp->y = y + tmp->arch->y;	1298	tmp->y = y + tmp->arch->y;
1244	}	1299	}
…		…
1269	object *	1324	object *
1270	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1325	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1271	{	1326	{
1272	op->remove ();	1327	op->remove ();
1273		1328
		1329	if (m == &freed_map)//D TODO: remove soon
		1330	{//D
		1331	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1332	}//D
		1333
1274	/* Ideally, the caller figures this out. However, it complicates a lot	1334	/* Ideally, the caller figures this out. However, it complicates a lot
1275	* of areas of callers (eg, anything that uses find_free_spot would now	1335	* of areas of callers (eg, anything that uses find_free_spot would now
1276	* need extra work	1336	* need extra work
1277	*/	1337	*/
		1338	maptile *newmap = m;
1278	if (!xy_normalise (m, op->x, op->y))	1339	if (!xy_normalise (newmap, op->x, op->y))
1279	{	1340	{
1280	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1341	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1281	return 0;	1342	return 0;
1282	}	1343	}
1283		1344
1284	if (object *more = op->more)	1345	if (object *more = op->more)
1285	if (!insert_ob_in_map (more, m, originator, flag))	1346	if (!insert_ob_in_map (more, m, originator, flag))
1286	return 0;	1347	return 0;
1287		1348
1288	CLEAR_FLAG (op, FLAG_REMOVED);	1349	op->flag [FLAG_REMOVED] = false;
1289		1350	op->env = 0;
1290	op->map = m;	1351	op->map = newmap;
		1352
1291	mapspace &ms = op->ms ();	1353	mapspace &ms = op->ms ();
1292		1354
1293	/* this has to be done after we translate the coordinates.	1355	/* this has to be done after we translate the coordinates.
1294	*/	1356	*/
1295	if (op->nrof && !(flag & INS_NO_MERGE))	1357	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1298	{	1360	{
1299	// TODO: we actually want to update tmp, not op,	1361	// TODO: we actually want to update tmp, not op,
1300	// but some caller surely breaks when we return tmp	1362	// but some caller surely breaks when we return tmp
1301	// from here :/	1363	// from here :/
1302	op->nrof += tmp->nrof;	1364	op->nrof += tmp->nrof;
1303	tmp->destroy (1);	1365	tmp->destroy ();
1304	}	1366	}
1305		1367
1306	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1368	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1307	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1369	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1308		1370
1309	if (!QUERY_FLAG (op, FLAG_ALIVE))	1371	if (!QUERY_FLAG (op, FLAG_ALIVE))
1310	CLEAR_FLAG (op, FLAG_NO_STEAL);	1372	CLEAR_FLAG (op, FLAG_NO_STEAL);
1311		1373
1312	if (flag & INS_BELOW_ORIGINATOR)	1374	if (flag & INS_BELOW_ORIGINATOR)
1313	{	1375	{
1314	if (originator->map != op->map \|\| originator->x != op->x \|\| originator->y != op->y \|\| !originator->is_on_map ())	1376	if (originator->map != op->map \|\| originator->x != op->x \|\| originator->y != op->y)
1315	{	1377	{
1316	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1378	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
		1379	abort ();
		1380	}
		1381
		1382	if (!originator->is_on_map ())
		1383	{
		1384	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1385	op->debug_desc (), originator->debug_desc ());
1317	abort ();	1386	abort ();
1318	}	1387	}
1319		1388
1320	op->above = originator;	1389	op->above = originator;
1321	op->below = originator->below;	1390	op->below = originator->below;
…		…
1390	} /* If objects on this space */	1459	} /* If objects on this space */
1391		1460
1392	if (flag & INS_ABOVE_FLOOR_ONLY)	1461	if (flag & INS_ABOVE_FLOOR_ONLY)
1393	top = floor;	1462	top = floor;
1394		1463
1395	/* Top is the object that our object (op) is going to get inserted above.	1464	// insert object above top, or bottom-most if top = 0
1396	*/
1397
1398	/* no top found, insert on top */
1399	if (!top)	1465	if (!top)
1400	{	1466	{
1401	op->above = 0;	1467	op->below = 0;
1402	op->below = ms.top;	1468	op->above = ms.bot;
1403	ms.top = op;	1469	ms.bot = op;
1404		1470
1405	*(op->below ? &op->below->above : &ms.bot) = op;	1471	*(op->above ? &op->above->below : &ms.top) = op;
1406	}	1472	}
1407	else	1473	else
1408	{ /* get inserted into the stack above top */	1474	{
1409	op->above = top->above;	1475	op->above = top->above;
1410	top->above = op;	1476	top->above = op;
1411		1477
1412	op->below = top;	1478	op->below = top;
1413	*(op->above ? &op->above->below : &ms.top) = op;	1479	*(op->above ? &op->above->below : &ms.top) = op;
1414	}	1480	}
1415	} /* else not INS_BELOW_ORIGINATOR */	1481	}
1416		1482
1417	if (op->type == PLAYER)	1483	if (op->is_player ())
1418	{	1484	{
1419	op->contr->do_los = 1;	1485	op->contr->do_los = 1;
1420	++op->map->players;	1486	++op->map->players;
1421	op->map->touch ();	1487	op->map->touch ();
1422	}	1488	}
…		…
1437	* be far away from this change and not affected in any way -	1503	* be far away from this change and not affected in any way -
1438	* this should get redone to only look for players within range,	1504	* this should get redone to only look for players within range,
1439	* or just updating the P_UPTODATE for spaces within this area	1505	* or just updating the P_UPTODATE for spaces within this area
1440	* of effect may be sufficient.	1506	* of effect may be sufficient.
1441	*/	1507	*/
1442	if (op->map->darkness && (op->glow_radius != 0))	1508	if (op->affects_los ())
		1509	{
		1510	op->ms ().invalidate ();
1443	update_all_los (op->map, op->x, op->y);	1511	update_all_los (op->map, op->x, op->y);
		1512	}
1444		1513
1445	/* updates flags (blocked, alive, no magic, etc) for this map space */	1514	/* updates flags (blocked, alive, no magic, etc) for this map space */
1446	update_object (op, UP_OBJ_INSERT);	1515	update_object (op, UP_OBJ_INSERT);
1447		1516
1448	INVOKE_OBJECT (INSERT, op);	1517	INVOKE_OBJECT (INSERT, op);
…		…
1455	* blocked() and wall() work properly), and these flags are updated by	1524	* blocked() and wall() work properly), and these flags are updated by
1456	* update_object().	1525	* update_object().
1457	*/	1526	*/
1458		1527
1459	/* if this is not the head or flag has been passed, don't check walk on status */	1528	/* if this is not the head or flag has been passed, don't check walk on status */
1460	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1529	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1461	{	1530	{
1462	if (check_move_on (op, originator))	1531	if (check_move_on (op, originator))
1463	return 0;	1532	return 0;
1464		1533
1465	/* If we are a multi part object, lets work our way through the check	1534	/* If we are a multi part object, lets work our way through the check
…		…
1476	/* this function inserts an object in the map, but if it	1545	/* this function inserts an object in the map, but if it
1477	* finds an object of its own type, it'll remove that one first.	1546	* finds an object of its own type, it'll remove that one first.
1478	* op is the object to insert it under: supplies x and the map.	1547	* op is the object to insert it under: supplies x and the map.
1479	*/	1548	*/
1480	void	1549	void
1481	replace_insert_ob_in_map (const char arch_string, object op)	1550	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1482	{	1551	{
1483	/* first search for itself and remove any old instances */	1552	/* first search for itself and remove any old instances */
1484		1553
1485	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1554	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1486	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1555	if (tmp->arch->archname == archname) /* same archetype */
1487	tmp->destroy (1);	1556	tmp->destroy ();
1488		1557
1489	object *tmp = arch_to_object (archetype::find (arch_string));	1558	object *tmp = archetype::find (archname)->instance ();
1490		1559
1491	tmp->x = op->x;	1560	tmp->x = op->x;
1492	tmp->y = op->y;	1561	tmp->y = op->y;
1493		1562
1494	insert_ob_in_map (tmp, op->map, op, 0);	1563	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1499	{	1568	{
1500	if (where->env)	1569	if (where->env)
1501	return where->env->insert (this);	1570	return where->env->insert (this);
1502	else	1571	else
1503	return where->map->insert (this, where->x, where->y, originator, flags);	1572	return where->map->insert (this, where->x, where->y, originator, flags);
		1573	}
		1574
		1575	// check whether we can put this into the map, respect max_volume, max_items
		1576	bool
		1577	object::can_drop_at (maptile m, int x, int y, object originator)
		1578	{
		1579	mapspace &ms = m->at (x, y);
		1580
		1581	int items = ms.items ();
		1582
		1583	if (!items // testing !items ensures we can drop at least one item
		1584	\|\| (items < m->max_items
		1585	&& ms.volume () < m->max_volume))
		1586	return true;
		1587
		1588	if (originator && originator->is_player ())
		1589	originator->contr->failmsg (format (
		1590	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1591	query_name ()
		1592	));
		1593
		1594	return false;
1504	}	1595	}
1505		1596
1506	/*	1597	/*
1507	* decrease(object, number) decreases a specified number from	1598	* decrease(object, number) decreases a specified number from
1508	* the amount of an object. If the amount reaches 0, the object	1599	* the amount of an object. If the amount reaches 0, the object
…		…
1516	if (!nr)	1607	if (!nr)
1517	return true;	1608	return true;
1518		1609
1519	nr = min (nr, nrof);	1610	nr = min (nr, nrof);
1520		1611
		1612	if (nrof > nr)
		1613	{
1521	nrof -= nr;	1614	nrof -= nr;
1522
1523	if (nrof)
1524	{
1525	adjust_weight (env, -weight * nr); // carrying == 0	1615	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1526		1616
1527	if (object *pl = visible_to ())	1617	if (object *pl = visible_to ())
1528	esrv_update_item (UPD_NROF, pl, this);	1618	esrv_update_item (UPD_NROF, pl, this);
1529		1619
1530	return true;	1620	return true;
1531	}	1621	}
1532	else	1622	else
1533	{	1623	{
1534	destroy (1);	1624	destroy ();
1535	return false;	1625	return false;
1536	}	1626	}
1537	}	1627	}
1538		1628
1539	/*	1629	/*
…		…
1616	if (object *pl = tmp->visible_to ())	1706	if (object *pl = tmp->visible_to ())
1617	esrv_update_item (UPD_NROF, pl, tmp);	1707	esrv_update_item (UPD_NROF, pl, tmp);
1618		1708
1619	adjust_weight (this, op->total_weight ());	1709	adjust_weight (this, op->total_weight ());
1620		1710
1621	op->destroy (1);	1711	op->destroy ();
1622	op = tmp;	1712	op = tmp;
1623	goto inserted;	1713	goto inserted;
1624	}	1714	}
1625		1715
1626	op->owner = 0; // it's his/hers now. period.	1716	op->owner = 0; // it's his/hers now. period.
…		…
1644		1734
1645	adjust_weight (this, op->total_weight ());	1735	adjust_weight (this, op->total_weight ());
1646		1736
1647	inserted:	1737	inserted:
1648	/* reset the light list and los of the players on the map */	1738	/* reset the light list and los of the players on the map */
1649	if (op->glow_radius && map && map->darkness)	1739	if (op->glow_radius && is_on_map ())
		1740	{
		1741	update_stats ();
1650	update_all_los (map, x, y);	1742	update_all_los (map, x, y);
1651		1743	}
		1744	else if (is_player ())
1652	// if this is a player's inventory, update stats	1745	// if this is a player's inventory, update stats
1653	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1746	contr->queue_stats_update ();
1654	update_stats ();
1655		1747
1656	INVOKE_OBJECT (INSERT, this);	1748	INVOKE_OBJECT (INSERT, this);
1657		1749
1658	return op;	1750	return op;
1659	}	1751	}
…		…
1679	* on top.	1771	* on top.
1680	*/	1772	*/
1681	int	1773	int
1682	check_move_on (object op, object originator)	1774	check_move_on (object op, object originator)
1683	{	1775	{
		1776	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1777	return 0;
		1778
1684	object *tmp;	1779	object *tmp;
1685	maptile *m = op->map;	1780	maptile *m = op->map;
1686	int x = op->x, y = op->y;	1781	int x = op->x, y = op->y;
1687		1782
1688	MoveType move_on, move_slow, move_block;	1783	mapspace &ms = m->at (x, y);
1689		1784
1690	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1785	ms.update ();
1691	return 0;
1692		1786
1693	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1787	MoveType move_on = ms.move_on;
1694	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1788	MoveType move_slow = ms.move_slow;
1695	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1789	MoveType move_block = ms.move_block;
1696		1790
1697	/* if nothing on this space will slow op down or be applied,	1791	/* if nothing on this space will slow op down or be applied,
1698	* no need to do checking below. have to make sure move_type	1792	* no need to do checking below. have to make sure move_type
1699	* is set, as lots of objects don't have it set - we treat that	1793	* is set, as lots of objects don't have it set - we treat that
1700	* as walking.	1794	* as walking.
…		…
1711	return 0;	1805	return 0;
1712		1806
1713	/* The objects have to be checked from top to bottom.	1807	/* The objects have to be checked from top to bottom.
1714	* Hence, we first go to the top:	1808	* Hence, we first go to the top:
1715	*/	1809	*/
1716		1810	for (object next, tmp = ms.top; tmp; tmp = next)
1717	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1718	{
1719	/* Trim the search when we find the first other spell effect
1720	* this helps performance so that if a space has 50 spell objects,
1721	* we don't need to check all of them.
1722	*/
1723	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1724	break;
1725	}	1811	{
		1812	next = tmp->below;
1726		1813
1727	for (; tmp; tmp = tmp->below)
1728	{
1729	if (tmp == op)	1814	if (tmp == op)
1730	continue; /* Can't apply yourself */	1815	continue; /* Can't apply yourself */
1731		1816
1732	/* Check to see if one of the movement types should be slowed down.	1817	/* Check to see if one of the movement types should be slowed down.
1733	* Second check makes sure that the movement types not being slowed	1818	* Second check makes sure that the movement types not being slowed
…		…
1738	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1823	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1739	{	1824	{
1740	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1825	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1741	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1826	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1742	{	1827	{
1743
1744	float
1745	diff = tmp->move_slow_penalty * fabs (op->speed);	1828	float diff = tmp->move_slow_penalty * fabs (op->speed);
1746		1829
1747	if (op->type == PLAYER)	1830	if (op->is_player ())
1748	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1831	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) \|\|
1749	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1832	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1750	diff /= 4.0;	1833	diff /= 4.0;
1751		1834
1752	op->speed_left -= diff;	1835	op->speed_left -= diff;
1753	}	1836	}
1754	}	1837	}
…		…
1960	* head of the object should correspond for the entire object.	2043	* head of the object should correspond for the entire object.
1961	*/	2044	*/
1962	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2045	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1963	continue;	2046	continue;
1964		2047
1965	if (ob->blocked (m, pos.x, pos.y))	2048	if (ob->blocked (pos.m, pos.x, pos.y))
1966	continue;	2049	continue;
1967		2050
1968	altern [index++] = i;	2051	altern [index++] = i;
1969	}	2052	}
1970		2053
…		…
2038	* there is capable of.	2121	* there is capable of.
2039	*/	2122	*/
2040	int	2123	int
2041	find_dir (maptile m, int x, int y, object exclude)	2124	find_dir (maptile m, int x, int y, object exclude)
2042	{	2125	{
2043	int i, max = SIZEOFFREE, mflags;	2126	int max = SIZEOFFREE, mflags;
2044
2045	sint16 nx, ny;
2046	object *tmp;
2047	maptile *mp;
2048
2049	MoveType blocked, move_type;	2127	MoveType move_type;
2050		2128
2051	if (exclude && exclude->head_ () != exclude)	2129	if (exclude && exclude->head_ () != exclude)
2052	{	2130	{
2053	exclude = exclude->head;	2131	exclude = exclude->head;
2054	move_type = exclude->move_type;	2132	move_type = exclude->move_type;
…		…
2057	{	2135	{
2058	/* If we don't have anything, presume it can use all movement types. */	2136	/* If we don't have anything, presume it can use all movement types. */
2059	move_type = MOVE_ALL;	2137	move_type = MOVE_ALL;
2060	}	2138	}
2061		2139
2062	for (i = 1; i < max; i++)	2140	for (int i = 1; i < max; i++)
2063	{	2141	{
2064	mp = m;	2142	mapxy pos (m, x, y);
2065	nx = x + freearr_x[i];	2143	pos.move (i);
2066	ny = y + freearr_y[i];
2067		2144
2068	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2145	if (!pos.normalise ())
2069
2070	if (mflags & P_OUT_OF_MAP)
2071	max = maxfree[i];	2146	max = maxfree[i];
2072	else	2147	else
2073	{	2148	{
2074	mapspace &ms = mp->at (nx, ny);	2149	mapspace &ms = *pos;
2075		2150
2076	blocked = ms.move_block;
2077
2078	if ((move_type & blocked) == move_type)	2151	if ((move_type & ms.move_block) == move_type)
2079	max = maxfree[i];	2152	max = maxfree [i];
2080	else if (mflags & P_IS_ALIVE)	2153	else if (ms.flags () & P_IS_ALIVE)
2081	{	2154	{
2082	for (tmp = ms.bot; tmp; tmp = tmp->above)	2155	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2083	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2156	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2084	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2157	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2085	break;
2086
2087	if (tmp)
2088	return freedir[i];	2158	return freedir [i];
2089	}	2159	}
2090	}	2160	}
2091	}	2161	}
2092		2162
2093	return 0;	2163	return 0;
…		…
2168	* This basically means that if direction is 15, then it could either go	2238	* This basically means that if direction is 15, then it could either go
2169	* direction 4, 14, or 16 to get back to where we are.	2239	* direction 4, 14, or 16 to get back to where we are.
2170	* Moved from spell_util.c to object.c with the other related direction	2240	* Moved from spell_util.c to object.c with the other related direction
2171	* functions.	2241	* functions.
2172	*/	2242	*/
2173	int reduction_dir[SIZEOFFREE][3] = {	2243	static const int reduction_dir[SIZEOFFREE][3] = {
2174	{0, 0, 0}, /* 0 */	2244	{0, 0, 0}, /* 0 */
2175	{0, 0, 0}, /* 1 */	2245	{0, 0, 0}, /* 1 */
2176	{0, 0, 0}, /* 2 */	2246	{0, 0, 0}, /* 2 */
2177	{0, 0, 0}, /* 3 */	2247	{0, 0, 0}, /* 3 */
2178	{0, 0, 0}, /* 4 */	2248	{0, 0, 0}, /* 4 */
…		…
2274	int	2344	int
2275	can_pick (const object who, const object item)	2345	can_pick (const object who, const object item)
2276	{	2346	{
2277	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2347	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2278	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2348	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2279	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER \|\| item->weight < who->weight / 3));	2349	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2280	}	2350	}
2281		2351
2282	/*	2352	/*
2283	* create clone from object to another	2353	* create clone from object to another
2284	*/	2354	*/
…		…
2316	return tmp;	2386	return tmp;
2317		2387
2318	return 0;	2388	return 0;
2319	}	2389	}
2320		2390
2321	const shstr &	2391	shstr_tmp
2322	object::kv_get (const shstr &key) const	2392	object::kv_get (shstr_tmp key) const
2323	{	2393	{
2324	for (key_value *kv = key_values; kv; kv = kv->next)	2394	for (key_value *kv = key_values; kv; kv = kv->next)
2325	if (kv->key == key)	2395	if (kv->key == key)
2326	return kv->value;	2396	return kv->value;
2327		2397
2328	return shstr_null;	2398	return shstr ();
2329	}	2399	}
2330		2400
2331	void	2401	void
2332	object::kv_set (const shstr &key, const shstr &value)	2402	object::kv_set (shstr_tmp key, shstr_tmp value)
2333	{	2403	{
2334	for (key_value *kv = key_values; kv; kv = kv->next)	2404	for (key_value *kv = key_values; kv; kv = kv->next)
2335	if (kv->key == key)	2405	if (kv->key == key)
2336	{	2406	{
2337	kv->value = value;	2407	kv->value = value;
…		…
2346		2416
2347	key_values = kv;	2417	key_values = kv;
2348	}	2418	}
2349		2419
2350	void	2420	void
2351	object::kv_del (const shstr &key)	2421	object::kv_del (shstr_tmp key)
2352	{	2422	{
2353	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2423	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2354	if ((*kvp)->key == key)	2424	if ((*kvp)->key == key)
2355	{	2425	{
2356	key_value kv = kvp;	2426	key_value kv = kvp;
…		…
2415	{	2485	{
2416	char flagdesc[512];	2486	char flagdesc[512];
2417	char info2[256 * 4];	2487	char info2[256 * 4];
2418	char *p = info;	2488	char *p = info;
2419		2489
2420	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2490	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2421	count,	2491	count,
2422	uuid.c_str (),	2492	uuid.c_str (),
2423	&name,	2493	&name,
2424	title ? "\",title:\"" : "",	2494	title ? ",title:\"" : "",
2425	title ? (const char *)title : "",	2495	title ? (const char *)title : "",
		2496	title ? "\"" : "",
2426	flag_desc (flagdesc, 512), type);	2497	flag_desc (flagdesc, 512), type);
2427		2498
2428	if (!flag[FLAG_REMOVED] && env)	2499	if (!flag[FLAG_REMOVED] && env)
2429	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2500	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2430		2501
…		…
2446	struct region *	2517	struct region *
2447	object::region () const	2518	object::region () const
2448	{	2519	{
2449	return map ? map->region (x, y)	2520	return map ? map->region (x, y)
2450	: region::default_region ();	2521	: region::default_region ();
2451	}
2452
2453	const materialtype_t *
2454	object::dominant_material () const
2455	{
2456	if (materialtype_t *mt = name_to_material (materialname))
2457	return mt;
2458
2459	return name_to_material (shstr_unknown);
2460	}	2522	}
2461		2523
2462	void	2524	void
2463	object::open_container (object *new_container)	2525	object::open_container (object *new_container)
2464	{	2526	{
…		…
2486	container = 0;	2548	container = 0;
2487		2549
2488	// client needs item update to make it work, client bug requires this to be separate	2550	// client needs item update to make it work, client bug requires this to be separate
2489	esrv_update_item (UPD_FLAGS, this, old_container);	2551	esrv_update_item (UPD_FLAGS, this, old_container);
2490		2552
2491	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2553	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2492	play_sound (sound_find ("chest_close"));	2554	play_sound (sound_find ("chest_close"));
2493	}	2555	}
2494		2556
2495	if (new_container)	2557	if (new_container)
2496	{	2558	{
…		…
2500	// TODO: this does not seem to serve any purpose anymore?	2562	// TODO: this does not seem to serve any purpose anymore?
2501	#if 0	2563	#if 0
2502	// insert the "Close Container" object.	2564	// insert the "Close Container" object.
2503	if (archetype *closer = new_container->other_arch)	2565	if (archetype *closer = new_container->other_arch)
2504	{	2566	{
2505	object *closer = arch_to_object (new_container->other_arch);	2567	object *closer = new_container->other_arch->instance ();
2506	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2568	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2507	new_container->insert (closer);	2569	new_container->insert (closer);
2508	}	2570	}
2509	#endif	2571	#endif
2510		2572
2511	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2573	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2512		2574
2513	// make sure the container is available, client bug requires this to be separate	2575	// make sure the container is available, client bug requires this to be separate
2514	esrv_send_item (this, new_container);	2576	esrv_send_item (this, new_container);
2515		2577
2516	new_container->flag [FLAG_APPLIED] = true;	2578	new_container->flag [FLAG_APPLIED] = true;
…		…
2524	// else if (!old_container->env && contr && contr->ns)	2586	// else if (!old_container->env && contr && contr->ns)
2525	// contr->ns->floorbox_reset ();	2587	// contr->ns->floorbox_reset ();
2526	}	2588	}
2527		2589
2528	object *	2590	object *
2529	object::force_find (const shstr name)	2591	object::force_find (shstr_tmp name)
2530	{	2592	{
2531	/* cycle through his inventory to look for the MARK we want to	2593	/* cycle through his inventory to look for the MARK we want to
2532	* place	2594	* place
2533	*/	2595	*/
2534	for (object *tmp = inv; tmp; tmp = tmp->below)	2596	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2536	return splay (tmp);	2598	return splay (tmp);
2537		2599
2538	return 0;	2600	return 0;
2539	}	2601	}
2540		2602
		2603	//-GPL
		2604
2541	void	2605	void
		2606	object::force_set_timer (int duration)
		2607	{
		2608	this->duration = 1;
		2609	this->speed_left = -1.f;
		2610
		2611	this->set_speed (duration ? 1.f / duration : 0.f);
		2612	}
		2613
		2614	object *
2542	object::force_add (const shstr name, int duration)	2615	object::force_add (shstr_tmp name, int duration)
2543	{	2616	{
2544	if (object *force = force_find (name))	2617	if (object *force = force_find (name))
2545	force->destroy ();	2618	force->destroy ();
2546		2619
2547	object *force = get_archetype (FORCE_NAME);	2620	object *force = get_archetype (FORCE_NAME);
2548		2621
2549	force->slaying = name;	2622	force->slaying = name;
2550	force->stats.food = 1;	2623	force->force_set_timer (duration);
2551	force->speed_left = -1.f;
2552
2553	force->set_speed (duration ? 1.f / duration : 0.f);
2554	force->flag [FLAG_IS_USED_UP] = true;
2555	force->flag [FLAG_APPLIED] = true;	2624	force->flag [FLAG_APPLIED] = true;
2556		2625
2557	insert (force);	2626	return insert (force);
2558	}	2627	}
2559		2628
2560	void	2629	void
2561	object::play_sound (faceidx sound)	2630	object::play_sound (faceidx sound) const
2562	{	2631	{
2563	if (!sound)	2632	if (!sound)
2564	return;	2633	return;
2565		2634
2566	if (flag [FLAG_REMOVED])	2635	if (is_on_map ())
		2636	map->play_sound (sound, x, y);
		2637	else if (object *pl = in_player ())
		2638	pl->contr->play_sound (sound);
		2639	}
		2640
		2641	void
		2642	object::say_msg (const char *msg) const
		2643	{
		2644	if (is_on_map ())
		2645	map->say_msg (msg, x, y);
		2646	else if (object *pl = in_player ())
		2647	pl->contr->play_sound (sound);
		2648	}
		2649
		2650	void
		2651	object::make_noise ()
		2652	{
		2653	// we do not model noise in the map, so instead put
		2654	// a temporary light into the noise source
		2655	// could use the map instead, but that's less reliable for our
		2656	// goal, which is to make invisibility a bit harder to exploit
		2657
		2658	// currently only works sensibly for players
		2659	if (!is_player ())
2567	return;	2660	return;
2568		2661
2569	if (env)	2662	// find old force, or create new one
2570	{	2663	object *force = force_find (shstr_noise_force);
2571	if (object *pl = in_player ())	2664
2572	pl->contr->play_sound (sound);	2665	if (force)
2573	}	2666	force->speed_left = -1.f; // patch old speed up
2574	else	2667	else
2575	map->play_sound (sound, x, y);	2668	{
2576	}	2669	force = archetype::get (shstr_noise_force);
2577		2670
		2671	force->slaying = shstr_noise_force;
		2672	force->stats.food = 1;
		2673	force->speed_left = -1.f;
		2674
		2675	force->set_speed (1.f / 4.f);
		2676	force->flag [FLAG_IS_USED_UP] = true;
		2677	force->flag [FLAG_APPLIED] = true;
		2678
		2679	insert (force);
		2680	}
		2681	}
		2682

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.237 by root, Tue May 6 21:04:37 2008 UTC vs. Revision 1.311 by root, Sat Jan 16 13:41:37 2010 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.237 by root, Tue May 6 21:04:37 2008 UTC vs.
Revision 1.311 by root, Sat Jan 16 13:41:37 2010 UTC