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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.246 by root, Thu May 22 15:37:44 2008 UTC vs.
Revision 1.320 by root, Wed Apr 7 19:54:44 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 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	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
…		…
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
222	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other	288	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
223	\|\| ob1->client_type != ob2->client_type	289	\|\| ob1->client_type != ob2->client_type
224	\|\| ob1->materialname != ob2->materialname	290	\|\| ob1->material != ob2->material
225	\|\| ob1->lore != ob2->lore	291	\|\| ob1->lore != ob2->lore
226	\|\| ob1->subtype != ob2->subtype	292	\|\| ob1->subtype != ob2->subtype
227	\|\| ob1->move_type != ob2->move_type	293	\|\| ob1->move_type != ob2->move_type
228	\|\| ob1->move_block != ob2->move_block	294	\|\| ob1->move_block != ob2->move_block
229	\|\| ob1->move_allow != ob2->move_allow	295	\|\| ob1->move_allow != ob2->move_allow
230	\|\| ob1->move_on != ob2->move_on	296	\|\| ob1->move_on != ob2->move_on
231	\|\| ob1->move_off != ob2->move_off	297	\|\| ob1->move_off != ob2->move_off
232	\|\| ob1->move_slow != ob2->move_slow	298	\|\| ob1->move_slow != ob2->move_slow
233	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty	299	\|\| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
234	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	300	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
235	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	301	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
236	return 0;	302	return 0;
237		303
238	if ((ob1->flag ^ ob2->flag)	304	if ((ob1->flag ^ ob2->flag)
239	.reset (FLAG_INV_LOCKED)	305	.reset (FLAG_INV_LOCKED)
240	.reset (FLAG_CLIENT_SENT)
241	.reset (FLAG_REMOVED)	306	.reset (FLAG_REMOVED)
242	.any ())	307	.any ())
243	return 0;	308	return 0;
244		309
245	/* This is really a spellbook check - we should in general	310	/* This is really a spellbook check - we should in general
…		…
327	{	392	{
328	// see if we are in a container of sorts	393	// see if we are in a container of sorts
329	if (env)	394	if (env)
330	{	395	{
331	// the player inventory itself is always visible	396	// the player inventory itself is always visible
332	if (env->type == PLAYER)	397	if (env->is_player ())
333	return env;	398	return env;
334		399
335	// else a player could have our env open	400	// else a player could have our env open
336	object *envest = env->outer_env ();	401	object *envest = env->outer_env_or_self ();
337		402
338	// 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
339	// even if our inv is in a player.	404	// even if our inv is in a player.
340	if (envest->is_on_map ())	405	if (envest->is_on_map ())
341	if (object *pl = envest->ms ().player ())	406	if (object *pl = envest->ms ().player ())
342	if (pl->container == env)	407	if (pl->container_ () == env)
343	return pl;	408	return pl;
344	}	409	}
345	else	410	else
346	{	411	{
347	// maybe there is a player standing on the same mapspace	412	// maybe there is a player standing on the same mapspace
348	// this will catch the case where "this" is a player	413	// this will catch the case where "this" is a player
349	if (object *pl = ms ().player ())	414	if (object *pl = ms ().player ())
350	if (!pl->container \|\| this == pl->container)	415	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		416	\|\| pl->container_ () == this)
351	return pl;	417	return pl;
352	}	418	}
353	}	419	}
354		420
355	return 0;	421	return 0;
…		…
433	object_freezer freezer;	499	object_freezer freezer;
434	op->write (freezer);	500	op->write (freezer);
435	return freezer.as_string ();	501	return freezer.as_string ();
436	}	502	}
437		503
438	/*	504	char *
439	* get_nearest_part(multi-object, object 2) returns the part of the	505	object::as_string ()
440	* multi-object 1 which is closest to the second object.
441	* If it's not a multi-object, it is returned.
442	*/
443	object *
444	get_nearest_part (object op, const object pl)
445	{	506	{
446	object tmp, closest;	507	return dump_object (this);
447	int last_dist, i;
448
449	if (!op->more)
450	return op;
451
452	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
453	tmp;
454	tmp = tmp->more)
455	if ((i = distance (tmp, pl)) < last_dist)
456	closest = tmp, last_dist = i;
457
458	return closest;
459	}	508	}
460		509
461	/*	510	/*
462	* 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.
463	* VERRRY slow.	512	* VERRRY slow.
…		…
465	object *	514	object *
466	find_object (tag_t i)	515	find_object (tag_t i)
467	{	516	{
468	for_all_objects (op)	517	for_all_objects (op)
469	if (op->count == i)	518	if (op->count == i)
		519	return op;
		520
		521	return 0;
		522	}
		523
		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)
470	return op;	534	return op;
471		535
472	return 0;	536	return 0;
473	}	537	}
474		538
…		…
508	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());	572	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
509	return;	573	return;
510	}	574	}
511		575
512	this->owner = owner;	576	this->owner = owner;
513	}
514
515	int
516	object::slottype () const
517	{
518	if (type == SKILL)
519	{
520	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
521	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
522	}
523	else
524	{
525	if (slot [body_combat].info) return slot_combat;
526	if (slot [body_range ].info) return slot_ranged;
527	}
528
529	return slot_none;
530	}
531
532	bool
533	object::change_weapon (object *ob)
534	{
535	if (current_weapon == ob)
536	return true;
537
538	if (chosen_skill)
539	chosen_skill->flag [FLAG_APPLIED] = false;
540
541	current_weapon = ob;
542	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
543
544	if (chosen_skill)
545	chosen_skill->flag [FLAG_APPLIED] = true;
546
547	update_stats ();
548
549	if (ob)
550	{
551	// now check wether any body locations became invalid, in which case
552	// we cannot apply the weapon at the moment.
553	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
554	if (slot[i].used < 0)
555	{
556	current_weapon = chosen_skill = 0;
557	update_stats ();
558
559	new_draw_info_format (NDI_UNIQUE, 0, this,
560	"You try to balance all your items at once, "
561	"but the %s is just too much for your body. "
562	"[You need to unapply some items first.]", &ob->name);
563	return false;
564	}
565
566	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
567	}
568	else
569	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
570
571	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
572	{
573	LOG (llevError \| logBacktrace, "%s changed to unapplied weapon %s",
574	&name, ob->debug_desc ());
575	return false;
576	}
577
578	return true;
579	}	577	}
580		578
581	/* Zero the key_values on op, decrementing the shared-string	579	/* Zero the key_values on op, decrementing the shared-string
582	* refcounts and freeing the links.	580	* refcounts and freeing the links.
583	*/	581	*/
…		…
636	tail = new_link;	634	tail = new_link;
637	}	635	}
638	}	636	}
639	}	637	}
640		638
641	if (speed < 0)	639	dst->activate ();
642	dst->speed_left -= rndm ();
643
644	dst->set_speed (dst->speed);
645	}	640	}
646		641
647	void	642	void
648	object::instantiate ()	643	object::instantiate ()
649	{	644	{
650	if (!uuid.seq) // HACK	645	if (!uuid.seq) // HACK
651	uuid = UUID::gen ();	646	uuid = UUID::gen ();
652		647
		648	// TODO: unclean state changes, should nt be done in copy_to AND instantiate
		649	if (flag [FLAG_RANDOM_SPEED] && speed)
		650	speed_left = - speed - rndm (); // TODO animation
		651	else
653	speed_left = -0.1f;	652	speed_left = -1.;
		653
654	/* copy the body_info to the body_used - this is only really	654	/* copy the body_info to the body_used - this is only really
655	* need for monsters, but doesn't hurt to do it for everything.	655	* need for monsters, but doesn't hurt to do it for everything.
656	* by doing so, when a monster is created, it has good starting	656	* by doing so, when a monster is created, it has good starting
657	* values for the body_used info, so when items are created	657	* values for the body_used info, so when items are created
658	* for it, they can be properly equipped.	658	* for it, they can be properly equipped.
…		…
666	object *	666	object *
667	object::clone ()	667	object::clone ()
668	{	668	{
669	object *neu = create ();	669	object *neu = create ();
670	copy_to (neu);	670	copy_to (neu);
		671
		672	// TODO: unclean state changes, should not be done in clone AND instantiate
		673	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		674	neu->speed_left = - neu->speed - rndm (); // TODO animation
		675
671	neu->map = map; // not copied by copy_to	676	neu->map = map; // not copied by copy_to
672	return neu;	677	return neu;
673	}	678	}
674		679
675	/*	680	/*
…		…
693	* This function needs to be called whenever the speed of an object changes.	698	* This function needs to be called whenever the speed of an object changes.
694	*/	699	*/
695	void	700	void
696	object::set_speed (float speed)	701	object::set_speed (float speed)
697	{	702	{
698	if (flag [FLAG_FREED] && speed)
699	{
700	LOG (llevError, "Object %s is freed but has speed.\n", &name);
701	speed = 0;
702	}
703
704	this->speed = speed;	703	this->speed = speed;
705		704
706	if (has_active_speed ())	705	if (has_active_speed ())
707	activate ();	706	activate ();
708	else	707	else
…		…
758		757
759	if (!(m.flags_ & P_UPTODATE))	758	if (!(m.flags_ & P_UPTODATE))
760	/* nop */;	759	/* nop */;
761	else if (action == UP_OBJ_INSERT)	760	else if (action == UP_OBJ_INSERT)
762	{	761	{
		762	#if 0
763	// this is likely overkill, TODO: revisit (schmorp)	763	// this is likely overkill, TODO: revisit (schmorp)
764	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	764	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
765	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	765	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
766	\|\| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	766	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
767	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	767	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
768	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	768	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
769	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	769	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
770	\|\| (m.move_on \| op->move_on ) != m.move_on	770	\|\| (m.move_on \| op->move_on ) != m.move_on
771	\|\| (m.move_off \| op->move_off ) != m.move_off	771	\|\| (m.move_off \| op->move_off ) != m.move_off
772	\|\| (m.move_slow \| op->move_slow) != m.move_slow	772	\|\| (m.move_slow \| op->move_slow) != m.move_slow
773	/* This isn't perfect, but I don't expect a lot of objects to	773	/* This isn't perfect, but I don't expect a lot of objects to
774	* to have move_allow right now.	774	* have move_allow right now.
775	*/	775	*/
776	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block	776	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block
		777	m.invalidate ();
		778	#else
777	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	779	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
778	m.flags_ = 0;	780	m.invalidate ();
		781	#endif
779	}	782	}
780	/* if the object is being removed, we can't make intelligent	783	/* if the object is being removed, we can't make intelligent
781	* decisions, because remove_ob can't really pass the object	784	* decisions, because remove_ob can't really pass the object
782	* that is being removed.	785	* that is being removed.
783	*/	786	*/
784	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	787	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
785	m.flags_ = 0;	788	m.invalidate ();
786	else if (action == UP_OBJ_FACE)	789	else if (action == UP_OBJ_FACE)
787	/* Nothing to do for that case */ ;	790	/* Nothing to do for that case */ ;
788	else	791	else
789	LOG (llevError, "update_object called with invalid action: %d\n", action);	792	LOG (llevError, "update_object called with invalid action: %d\n", action);
790		793
…		…
794		797
795	object::object ()	798	object::object ()
796	{	799	{
797	SET_FLAG (this, FLAG_REMOVED);	800	SET_FLAG (this, FLAG_REMOVED);
798		801
799	expmul = 1.0;	802	//expmul = 1.0; declared const for the time being
800	face = blank_face;	803	face = blank_face;
		804	material = MATERIAL_NULL;
801	}	805	}
802		806
803	object::~object ()	807	object::~object ()
804	{	808	{
805	unlink ();	809	unlink ();
…		…
834	/* If already on active list, don't do anything */	838	/* If already on active list, don't do anything */
835	if (active)	839	if (active)
836	return;	840	return;
837		841
838	if (has_active_speed ())	842	if (has_active_speed ())
		843	{
		844	if (flag [FLAG_FREED])
		845	LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		846
839	actives.insert (this);	847	actives.insert (this);
		848	}
840	}	849	}
841		850
842	void	851	void
843	object::activate_recursive ()	852	object::activate_recursive ()
844	{	853	{
…		…
909	\|\| map->in_memory != MAP_ACTIVE	918	\|\| map->in_memory != MAP_ACTIVE
910	\|\| map->no_drop	919	\|\| map->no_drop
911	\|\| ms ().move_block == MOVE_ALL)	920	\|\| ms ().move_block == MOVE_ALL)
912	{	921	{
913	while (inv)	922	while (inv)
914	{
915	inv->destroy_inv (false);
916	inv->destroy ();	923	inv->destroy ();
917	}
918	}	924	}
919	else	925	else
920	{ /* Put objects in inventory onto this space */	926	{ /* Put objects in inventory onto this space */
921	while (inv)	927	while (inv)
922	{	928	{
…		…
926	\|\| op->flag [FLAG_NO_DROP]	932	\|\| op->flag [FLAG_NO_DROP]
927	\|\| op->type == RUNE	933	\|\| op->type == RUNE
928	\|\| op->type == TRAP	934	\|\| op->type == TRAP
929	\|\| op->flag [FLAG_IS_A_TEMPLATE]	935	\|\| op->flag [FLAG_IS_A_TEMPLATE]
930	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	936	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
931	op->destroy (true);	937	op->destroy ();
932	else	938	else
933	map->insert (op, x, y);	939	map->insert (op, x, y);
934	}	940	}
		941	}
		942	}
		943
		944	/*
		945	* Remove and free all objects in the inventory of the given object.
		946	* Unlike destroy_inv, this assumes the *this is destroyed as well
		947	* well, so we can (and have to!) take shortcuts.
		948	*/
		949	void
		950	object::destroy_inv_fast ()
		951	{
		952	while (object *op = inv)
		953	{
		954	// remove from object the fast way
		955	op->flag [FLAG_REMOVED] = true;
		956	op->env = 0;
		957	if ((inv = inv->below))
		958	inv->above = 0;
		959
		960	// then destroy
		961	op->destroy ();
935	}	962	}
936	}	963	}
937		964
938	object *object::create ()	965	object *object::create ()
939	{	966	{
…		…
965		992
966	void	993	void
967	object::do_destroy ()	994	object::do_destroy ()
968	{	995	{
969	if (flag [FLAG_IS_LINKED])	996	if (flag [FLAG_IS_LINKED])
970	remove_button_link (this);	997	remove_link ();
971		998
972	if (flag [FLAG_FRIENDLY])	999	if (flag [FLAG_FRIENDLY])
973	remove_friendly_object (this);	1000	remove_friendly_object (this);
974		1001
975	remove ();	1002	remove ();
…		…
1000	attacked_by = 0;	1027	attacked_by = 0;
1001	current_weapon = 0;	1028	current_weapon = 0;
1002	}	1029	}
1003		1030
1004	void	1031	void
1005	object::destroy (bool destroy_inventory)	1032	object::destroy ()
1006	{	1033	{
1007	if (destroyed ())	1034	if (destroyed ())
1008	return;	1035	return;
1009		1036
1010	if (!is_head () && !head->destroyed ())	1037	if (!is_head () && !head->destroyed ())
1011	{	1038	{
1012	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1039	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1013	head->destroy (destroy_inventory);	1040	head->destroy ();
1014	return;	1041	return;
1015	}	1042	}
1016		1043
1017	destroy_inv (!destroy_inventory);	1044	destroy_inv_fast ();
1018		1045
1019	if (is_head ())	1046	if (is_head ())
1020	if (sound_destroy)	1047	if (sound_destroy)
1021	play_sound (sound_destroy);	1048	play_sound (sound_destroy);
1022	else if (flag [FLAG_MONSTER])	1049	else if (flag [FLAG_MONSTER])
…		…
1033	* the previous environment.	1060	* the previous environment.
1034	*/	1061	*/
1035	void	1062	void
1036	object::do_remove ()	1063	object::do_remove ()
1037	{	1064	{
1038	object tmp, last = 0;
1039	object *otmp;
1040
1041	if (flag [FLAG_REMOVED])	1065	if (flag [FLAG_REMOVED])
1042	return;	1066	return;
1043		1067
1044	INVOKE_OBJECT (REMOVE, this);	1068	INVOKE_OBJECT (REMOVE, this);
1045		1069
…		…
1058	if (object *pl = visible_to ())	1082	if (object *pl = visible_to ())
1059	esrv_del_item (pl->contr, count);	1083	esrv_del_item (pl->contr, count);
1060	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1084	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1061		1085
1062	adjust_weight (env, -total_weight ());	1086	adjust_weight (env, -total_weight ());
		1087
		1088	object *pl = in_player ();
1063		1089
1064	/* we set up values so that it could be inserted into	1090	/* we set up values so that it could be inserted into
1065	* the map, but we don't actually do that - it is up	1091	* the map, but we don't actually do that - it is up
1066	* to the caller to decide what we want to do.	1092	* to the caller to decide what we want to do.
1067	*/	1093	*/
…		…
1075		1101
1076	above = 0;	1102	above = 0;
1077	below = 0;	1103	below = 0;
1078	env = 0;	1104	env = 0;
1079		1105
1080	/* NO_FIX_PLAYER is set when a great many changes are being	1106	if (pl && pl->is_player ())
1081	* made to players inventory. If set, avoiding the call
1082	* to save cpu time.
1083	*/	1107	{
1084	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1108	if (expect_false (pl->contr->combat_ob == this))
1085	otmp->update_stats ();	1109	{
		1110	pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
		1111	pl->contr->combat_ob = 0;
		1112	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1113	}
		1114
		1115	if (expect_false (pl->contr->ranged_ob == this))
		1116	{
		1117	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
		1118	pl->contr->ranged_ob = 0;
		1119	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1120	}
		1121
		1122	pl->contr->queue_stats_update ();
		1123
		1124	if (expect_false (glow_radius) && pl->is_on_map ())
		1125	update_all_los (pl->map, pl->x, pl->y);
		1126	}
1086	}	1127	}
1087	else if (map)	1128	else if (map)
1088	{	1129	{
1089	map->dirty = true;	1130	map->dirty = true;
1090	mapspace &ms = this->ms ();	1131	mapspace &ms = this->ms ();
1091		1132
1092	if (object *pl = ms.player ())	1133	if (object *pl = ms.player ())
1093	{	1134	{
1094	if (type == PLAYER) // this == pl(!)	1135	if (is_player ())
1095	{	1136	{
		1137	if (!flag [FLAG_WIZPASS])
		1138	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1139
1096	// leaving a spot always closes any open container on the ground	1140	// leaving a spot always closes any open container on the ground
1097	if (container && !container->env)	1141	if (container && !container->env)
1098	// this causes spurious floorbox updates, but it ensures	1142	// this causes spurious floorbox updates, but it ensures
1099	// that the CLOSE event is being sent.	1143	// that the CLOSE event is being sent.
1100	close_container ();	1144	close_container ();
1101		1145
1102	--map->players;	1146	--map->players;
1103	map->touch ();	1147	map->touch ();
1104	}	1148	}
1105	else if (pl->container == this)	1149	else if (pl->container_ () == this)
1106	{	1150	{
1107	// removing a container should close it	1151	// removing a container should close it
1108	close_container ();	1152	close_container ();
1109	}	1153	}
1110		1154
…		…
1117	*(below ? &below->above : &ms.bot) = above;	1161	*(below ? &below->above : &ms.bot) = above;
1118		1162
1119	above = 0;	1163	above = 0;
1120	below = 0;	1164	below = 0;
1121		1165
		1166	ms.invalidate ();
		1167
1122	if (map->in_memory == MAP_SAVING)	1168	if (map->in_memory == MAP_SAVING)
1123	return;	1169	return;
1124		1170
1125	int check_walk_off = !flag [FLAG_NO_APPLY];	1171	int check_walk_off = !flag [FLAG_NO_APPLY];
1126		1172
1127	if (object *pl = ms.player ())	1173	if (object *pl = ms.player ())
1128	{	1174	{
1129	if (pl->container == this)	1175	if (pl->container_ () == this)
1130	/* If a container that the player is currently using somehow gets	1176	/* If a container that the player is currently using somehow gets
1131	* removed (most likely destroyed), update the player view	1177	* removed (most likely destroyed), update the player view
1132	* appropriately.	1178	* appropriately.
1133	*/	1179	*/
1134	pl->close_container ();	1180	pl->close_container ();
…		…
1138	//TODO: update floorbox to preserve ordering	1184	//TODO: update floorbox to preserve ordering
1139	if (pl->contr->ns)	1185	if (pl->contr->ns)
1140	pl->contr->ns->floorbox_update ();	1186	pl->contr->ns->floorbox_update ();
1141	}	1187	}
1142		1188
		1189	if (check_walk_off)
1143	for (tmp = ms.bot; tmp; tmp = tmp->above)	1190	for (object above, tmp = ms.bot; tmp; tmp = above)
1144	{	1191	{
		1192	above = tmp->above;
		1193
1145	/* No point updating the players look faces if he is the object	1194	/* No point updating the players look faces if he is the object
1146	* being removed.	1195	* being removed.
1147	*/	1196	*/
1148		1197
1149	/* See if object moving off should effect something */	1198	/* See if object moving off should effect something */
1150	if (check_walk_off
1151	&& ((move_type & tmp->move_off)	1199	if ((move_type & tmp->move_off)
1152	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1200	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1153	{
1154	move_apply (tmp, this, 0);	1201	move_apply (tmp, this, 0);
1155
1156	if (destroyed ())
1157	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1158	}	1202	}
1159		1203
1160	last = tmp;	1204	if (affects_los ())
1161	}
1162
1163	/* last == NULL if there are no objects on this space */
1164	//TODO: this makes little sense, why only update the topmost object?
1165	if (!last)
1166	map->at (x, y).flags_ = 0;
1167	else
1168	update_object (last, UP_OBJ_REMOVE);
1169
1170	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1171	update_all_los (map, x, y);	1205	update_all_los (map, x, y);
1172	}	1206	}
1173	}	1207	}
1174		1208
1175	/*	1209	/*
…		…
1199	esrv_update_item (UPD_NROF, pl, top);	1233	esrv_update_item (UPD_NROF, pl, top);
1200		1234
1201	op->weight = 0; // cancel the addition above	1235	op->weight = 0; // cancel the addition above
1202	op->carrying = 0; // must be 0 already	1236	op->carrying = 0; // must be 0 already
1203		1237
1204	op->destroy (1);	1238	op->destroy ();
1205		1239
1206	return top;	1240	return top;
1207	}	1241	}
1208		1242
1209	return 0;	1243	return 0;
…		…
1217		1251
1218	object *prev = this;	1252	object *prev = this;
1219		1253
1220	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)	1254	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1221	{	1255	{
1222	object *op = arch_to_object (at);	1256	object *op = at->instance ();
1223		1257
1224	op->name = name;	1258	op->name = name;
1225	op->name_pl = name_pl;	1259	op->name_pl = name_pl;
1226	op->title = title;	1260	op->title = title;
1227		1261
…		…
1265	* Passing 0 for flag gives proper default values, so flag really only needs	1299	* Passing 0 for flag gives proper default values, so flag really only needs
1266	* to be set if special handling is needed.	1300	* to be set if special handling is needed.
1267	*	1301	*
1268	* Return value:	1302	* Return value:
1269	* new object if 'op' was merged with other object	1303	* new object if 'op' was merged with other object
1270	* NULL if 'op' was destroyed	1304	* NULL if there was an error (destroyed, blocked etc.)
1271	* just 'op' otherwise	1305	* just 'op' otherwise
1272	*/	1306	*/
1273	object *	1307	object *
1274	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1308	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1275	{	1309	{
1276	if (op->is_on_map ())
1277	{
1278	LOG (llevError, "insert_ob_in_map called for object already on map");
1279	abort ();
1280	}
1281
1282	if (op->env)
1283	{
1284	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1285	op->remove ();	1310	op->remove ();
1286	}
1287		1311
1288	if (op->face && !face_info (op->face))//D TODO: remove soon	1312	if (m == &freed_map)//D TODO: remove soon
1289	{//D	1313	{//D
1290	LOG (llevError \| logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D	1314	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1291	op->face = 1;//D
1292	}//D	1315	}//D
1293		1316
1294	/* Ideally, the caller figures this out. However, it complicates a lot	1317	/* Ideally, the caller figures this out. However, it complicates a lot
1295	* of areas of callers (eg, anything that uses find_free_spot would now	1318	* of areas of callers (eg, anything that uses find_free_spot would now
1296	* need extra work	1319	* need extra work
1297	*/	1320	*/
		1321	maptile *newmap = m;
1298	if (!xy_normalise (m, op->x, op->y))	1322	if (!xy_normalise (newmap, op->x, op->y))
1299	{	1323	{
1300	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1324	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1301	return 0;	1325	return 0;
1302	}	1326	}
1303		1327
1304	if (object *more = op->more)	1328	if (object *more = op->more)
1305	if (!insert_ob_in_map (more, m, originator, flag))	1329	if (!insert_ob_in_map (more, m, originator, flag))
1306	return 0;	1330	return 0;
1307		1331
1308	CLEAR_FLAG (op, FLAG_REMOVED);	1332	op->flag [FLAG_REMOVED] = false;
1309		1333	op->env = 0;
1310	op->map = m;	1334	op->map = newmap;
		1335
1311	mapspace &ms = op->ms ();	1336	mapspace &ms = op->ms ();
1312		1337
1313	/* this has to be done after we translate the coordinates.	1338	/* this has to be done after we translate the coordinates.
1314	*/	1339	*/
1315	if (op->nrof && !(flag & INS_NO_MERGE))	1340	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1318	{	1343	{
1319	// TODO: we actually want to update tmp, not op,	1344	// TODO: we actually want to update tmp, not op,
1320	// but some caller surely breaks when we return tmp	1345	// but some caller surely breaks when we return tmp
1321	// from here :/	1346	// from here :/
1322	op->nrof += tmp->nrof;	1347	op->nrof += tmp->nrof;
1323	tmp->destroy (1);	1348	tmp->destroy ();
1324	}	1349	}
1325		1350
1326	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1351	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1327	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1352	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1328		1353
…		…
1336	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1361	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1337	abort ();	1362	abort ();
1338	}	1363	}
1339		1364
1340	if (!originator->is_on_map ())	1365	if (!originator->is_on_map ())
		1366	{
1341	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",	1367	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1342	op->debug_desc (), originator->debug_desc ());	1368	op->debug_desc (), originator->debug_desc ());
		1369	abort ();
		1370	}
1343		1371
1344	op->above = originator;	1372	op->above = originator;
1345	op->below = originator->below;	1373	op->below = originator->below;
1346	originator->below = op;	1374	originator->below = op;
1347		1375
…		…
1433	op->below = top;	1461	op->below = top;
1434	*(op->above ? &op->above->below : &ms.top) = op;	1462	*(op->above ? &op->above->below : &ms.top) = op;
1435	}	1463	}
1436	}	1464	}
1437		1465
1438	if (op->type == PLAYER)	1466	if (op->is_player ())
1439	{	1467	{
1440	op->contr->do_los = 1;	1468	op->contr->do_los = 1;
1441	++op->map->players;	1469	++op->map->players;
1442	op->map->touch ();	1470	op->map->touch ();
1443	}	1471	}
…		…
1458	* be far away from this change and not affected in any way -	1486	* be far away from this change and not affected in any way -
1459	* this should get redone to only look for players within range,	1487	* this should get redone to only look for players within range,
1460	* or just updating the P_UPTODATE for spaces within this area	1488	* or just updating the P_UPTODATE for spaces within this area
1461	* of effect may be sufficient.	1489	* of effect may be sufficient.
1462	*/	1490	*/
1463	if (op->map->darkness && (op->glow_radius != 0))	1491	if (op->affects_los ())
		1492	{
		1493	op->ms ().invalidate ();
1464	update_all_los (op->map, op->x, op->y);	1494	update_all_los (op->map, op->x, op->y);
		1495	}
1465		1496
1466	/* updates flags (blocked, alive, no magic, etc) for this map space */	1497	/* updates flags (blocked, alive, no magic, etc) for this map space */
1467	update_object (op, UP_OBJ_INSERT);	1498	update_object (op, UP_OBJ_INSERT);
1468		1499
1469	INVOKE_OBJECT (INSERT, op);	1500	INVOKE_OBJECT (INSERT, op);
…		…
1476	* blocked() and wall() work properly), and these flags are updated by	1507	* blocked() and wall() work properly), and these flags are updated by
1477	* update_object().	1508	* update_object().
1478	*/	1509	*/
1479		1510
1480	/* if this is not the head or flag has been passed, don't check walk on status */	1511	/* if this is not the head or flag has been passed, don't check walk on status */
1481	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1512	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1482	{	1513	{
1483	if (check_move_on (op, originator))	1514	if (check_move_on (op, originator))
1484	return 0;	1515	return 0;
1485		1516
1486	/* If we are a multi part object, lets work our way through the check	1517	/* If we are a multi part object, lets work our way through the check
…		…
1497	/* this function inserts an object in the map, but if it	1528	/* this function inserts an object in the map, but if it
1498	* finds an object of its own type, it'll remove that one first.	1529	* finds an object of its own type, it'll remove that one first.
1499	* op is the object to insert it under: supplies x and the map.	1530	* op is the object to insert it under: supplies x and the map.
1500	*/	1531	*/
1501	void	1532	void
1502	replace_insert_ob_in_map (const char arch_string, object op)	1533	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1503	{	1534	{
1504	/* first search for itself and remove any old instances */	1535	/* first search for itself and remove any old instances */
1505		1536
1506	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1537	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1507	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1538	if (tmp->arch->archname == archname) /* same archetype */
1508	tmp->destroy (1);	1539	tmp->destroy ();
1509		1540
1510	object *tmp = arch_to_object (archetype::find (arch_string));	1541	object *tmp = archetype::find (archname)->instance ();
1511		1542
1512	tmp->x = op->x;	1543	tmp->x = op->x;
1513	tmp->y = op->y;	1544	tmp->y = op->y;
1514		1545
1515	insert_ob_in_map (tmp, op->map, op, 0);	1546	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1520	{	1551	{
1521	if (where->env)	1552	if (where->env)
1522	return where->env->insert (this);	1553	return where->env->insert (this);
1523	else	1554	else
1524	return where->map->insert (this, where->x, where->y, originator, flags);	1555	return where->map->insert (this, where->x, where->y, originator, flags);
		1556	}
		1557
		1558	// check whether we can put this into the map, respect max_volume, max_items
		1559	bool
		1560	object::can_drop_at (maptile m, int x, int y, object originator)
		1561	{
		1562	mapspace &ms = m->at (x, y);
		1563
		1564	int items = ms.items ();
		1565
		1566	if (!items // testing !items ensures we can drop at least one item
		1567	\|\| (items < m->max_items
		1568	&& ms.volume () < m->max_volume))
		1569	return true;
		1570
		1571	if (originator && originator->is_player ())
		1572	originator->contr->failmsg (format (
		1573	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1574	query_name ()
		1575	));
		1576
		1577	return false;
1525	}	1578	}
1526		1579
1527	/*	1580	/*
1528	* decrease(object, number) decreases a specified number from	1581	* decrease(object, number) decreases a specified number from
1529	* the amount of an object. If the amount reaches 0, the object	1582	* the amount of an object. If the amount reaches 0, the object
…		…
1537	if (!nr)	1590	if (!nr)
1538	return true;	1591	return true;
1539		1592
1540	nr = min (nr, nrof);	1593	nr = min (nr, nrof);
1541		1594
		1595	if (nrof > nr)
		1596	{
1542	nrof -= nr;	1597	nrof -= nr;
1543
1544	if (nrof)
1545	{
1546	adjust_weight (env, -weight * nr); // carrying == 0	1598	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1547		1599
1548	if (object *pl = visible_to ())	1600	if (object *pl = visible_to ())
1549	esrv_update_item (UPD_NROF, pl, this);	1601	esrv_update_item (UPD_NROF, pl, this);
1550		1602
1551	return true;	1603	return true;
1552	}	1604	}
1553	else	1605	else
1554	{	1606	{
1555	destroy (1);	1607	destroy ();
1556	return false;	1608	return false;
1557	}	1609	}
1558	}	1610	}
1559		1611
1560	/*	1612	/*
…		…
1637	if (object *pl = tmp->visible_to ())	1689	if (object *pl = tmp->visible_to ())
1638	esrv_update_item (UPD_NROF, pl, tmp);	1690	esrv_update_item (UPD_NROF, pl, tmp);
1639		1691
1640	adjust_weight (this, op->total_weight ());	1692	adjust_weight (this, op->total_weight ());
1641		1693
1642	op->destroy (1);	1694	op->destroy ();
1643	op = tmp;	1695	op = tmp;
1644	goto inserted;	1696	goto inserted;
1645	}	1697	}
1646		1698
1647	op->owner = 0; // it's his/hers now. period.	1699	op->owner = 0; // it's his/hers now. period.
…		…
1665		1717
1666	adjust_weight (this, op->total_weight ());	1718	adjust_weight (this, op->total_weight ());
1667		1719
1668	inserted:	1720	inserted:
1669	/* reset the light list and los of the players on the map */	1721	/* reset the light list and los of the players on the map */
1670	if (op->glow_radius && map && map->darkness)	1722	if (op->glow_radius && is_on_map ())
		1723	{
		1724	update_stats ();
1671	update_all_los (map, x, y);	1725	update_all_los (map, x, y);
1672		1726	}
		1727	else if (is_player ())
1673	// if this is a player's inventory, update stats	1728	// if this is a player's inventory, update stats
1674	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1729	contr->queue_stats_update ();
1675	update_stats ();
1676		1730
1677	INVOKE_OBJECT (INSERT, this);	1731	INVOKE_OBJECT (INSERT, this);
1678		1732
1679	return op;	1733	return op;
1680	}	1734	}
…		…
1700	* on top.	1754	* on top.
1701	*/	1755	*/
1702	int	1756	int
1703	check_move_on (object op, object originator)	1757	check_move_on (object op, object originator)
1704	{	1758	{
		1759	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1760	return 0;
		1761
1705	object *tmp;	1762	object *tmp;
1706	maptile *m = op->map;	1763	maptile *m = op->map;
1707	int x = op->x, y = op->y;	1764	int x = op->x, y = op->y;
1708		1765
1709	MoveType move_on, move_slow, move_block;	1766	mapspace &ms = m->at (x, y);
1710		1767
1711	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1768	ms.update ();
1712	return 0;
1713		1769
1714	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1770	MoveType move_on = ms.move_on;
1715	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1771	MoveType move_slow = ms.move_slow;
1716	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1772	MoveType move_block = ms.move_block;
1717		1773
1718	/* if nothing on this space will slow op down or be applied,	1774	/* if nothing on this space will slow op down or be applied,
1719	* no need to do checking below. have to make sure move_type	1775	* no need to do checking below. have to make sure move_type
1720	* is set, as lots of objects don't have it set - we treat that	1776	* is set, as lots of objects don't have it set - we treat that
1721	* as walking.	1777	* as walking.
…		…
1732	return 0;	1788	return 0;
1733		1789
1734	/* The objects have to be checked from top to bottom.	1790	/* The objects have to be checked from top to bottom.
1735	* Hence, we first go to the top:	1791	* Hence, we first go to the top:
1736	*/	1792	*/
1737		1793	for (object next, tmp = ms.top; tmp; tmp = next)
1738	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1739	{
1740	/* Trim the search when we find the first other spell effect
1741	* this helps performance so that if a space has 50 spell objects,
1742	* we don't need to check all of them.
1743	*/
1744	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1745	break;
1746	}	1794	{
		1795	next = tmp->below;
1747		1796
1748	for (; tmp; tmp = tmp->below)
1749	{
1750	if (tmp == op)	1797	if (tmp == op)
1751	continue; /* Can't apply yourself */	1798	continue; /* Can't apply yourself */
1752		1799
1753	/* Check to see if one of the movement types should be slowed down.	1800	/* Check to see if one of the movement types should be slowed down.
1754	* Second check makes sure that the movement types not being slowed	1801	* Second check makes sure that the movement types not being slowed
…		…
1759	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1806	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1760	{	1807	{
1761	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1808	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1762	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1809	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1763	{	1810	{
1764
1765	float
1766	diff = tmp->move_slow_penalty * fabs (op->speed);	1811	float diff = tmp->move_slow_penalty * fabs (op->speed);
1767		1812
1768	if (op->type == PLAYER)	1813	if (op->is_player ())
1769	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1814	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) \|\|
1770	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1815	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1771	diff /= 4.0;	1816	diff /= 4.0;
1772		1817
1773	op->speed_left -= diff;	1818	op->speed_left -= diff;
1774	}	1819	}
1775	}	1820	}
…		…
1981	* head of the object should correspond for the entire object.	2026	* head of the object should correspond for the entire object.
1982	*/	2027	*/
1983	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2028	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1984	continue;	2029	continue;
1985		2030
1986	if (ob->blocked (m, pos.x, pos.y))	2031	if (ob->blocked (pos.m, pos.x, pos.y))
1987	continue;	2032	continue;
1988		2033
1989	altern [index++] = i;	2034	altern [index++] = i;
1990	}	2035	}
1991		2036
…		…
2059	* there is capable of.	2104	* there is capable of.
2060	*/	2105	*/
2061	int	2106	int
2062	find_dir (maptile m, int x, int y, object exclude)	2107	find_dir (maptile m, int x, int y, object exclude)
2063	{	2108	{
2064	int i, max = SIZEOFFREE, mflags;	2109	int max = SIZEOFFREE, mflags;
2065
2066	sint16 nx, ny;
2067	object *tmp;
2068	maptile *mp;
2069
2070	MoveType blocked, move_type;	2110	MoveType move_type;
2071		2111
2072	if (exclude && exclude->head_ () != exclude)	2112	if (exclude && exclude->head_ () != exclude)
2073	{	2113	{
2074	exclude = exclude->head;	2114	exclude = exclude->head;
2075	move_type = exclude->move_type;	2115	move_type = exclude->move_type;
…		…
2078	{	2118	{
2079	/* If we don't have anything, presume it can use all movement types. */	2119	/* If we don't have anything, presume it can use all movement types. */
2080	move_type = MOVE_ALL;	2120	move_type = MOVE_ALL;
2081	}	2121	}
2082		2122
2083	for (i = 1; i < max; i++)	2123	for (int i = 1; i < max; i++)
2084	{	2124	{
2085	mp = m;	2125	mapxy pos (m, x, y);
2086	nx = x + freearr_x[i];	2126	pos.move (i);
2087	ny = y + freearr_y[i];
2088		2127
2089	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2128	if (!pos.normalise ())
2090
2091	if (mflags & P_OUT_OF_MAP)
2092	max = maxfree[i];	2129	max = maxfree[i];
2093	else	2130	else
2094	{	2131	{
2095	mapspace &ms = mp->at (nx, ny);	2132	mapspace &ms = *pos;
2096		2133
2097	blocked = ms.move_block;
2098
2099	if ((move_type & blocked) == move_type)	2134	if ((move_type & ms.move_block) == move_type)
2100	max = maxfree[i];	2135	max = maxfree [i];
2101	else if (mflags & P_IS_ALIVE)	2136	else if (ms.flags () & P_IS_ALIVE)
2102	{	2137	{
2103	for (tmp = ms.bot; tmp; tmp = tmp->above)	2138	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2104	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2139	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2105	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2140	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2106	break;
2107
2108	if (tmp)
2109	return freedir[i];	2141	return freedir [i];
2110	}	2142	}
2111	}	2143	}
2112	}	2144	}
2113		2145
2114	return 0;	2146	return 0;
…		…
2189	* This basically means that if direction is 15, then it could either go	2221	* This basically means that if direction is 15, then it could either go
2190	* direction 4, 14, or 16 to get back to where we are.	2222	* direction 4, 14, or 16 to get back to where we are.
2191	* Moved from spell_util.c to object.c with the other related direction	2223	* Moved from spell_util.c to object.c with the other related direction
2192	* functions.	2224	* functions.
2193	*/	2225	*/
2194	int reduction_dir[SIZEOFFREE][3] = {	2226	static const int reduction_dir[SIZEOFFREE][3] = {
2195	{0, 0, 0}, /* 0 */	2227	{0, 0, 0}, /* 0 */
2196	{0, 0, 0}, /* 1 */	2228	{0, 0, 0}, /* 1 */
2197	{0, 0, 0}, /* 2 */	2229	{0, 0, 0}, /* 2 */
2198	{0, 0, 0}, /* 3 */	2230	{0, 0, 0}, /* 3 */
2199	{0, 0, 0}, /* 4 */	2231	{0, 0, 0}, /* 4 */
…		…
2295	int	2327	int
2296	can_pick (const object who, const object item)	2328	can_pick (const object who, const object item)
2297	{	2329	{
2298	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2330	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2299	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2331	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2300	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER \|\| item->weight < who->weight / 3));	2332	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2301	}	2333	}
2302		2334
2303	/*	2335	/*
2304	* create clone from object to another	2336	* create clone from object to another
2305	*/	2337	*/
…		…
2337	return tmp;	2369	return tmp;
2338		2370
2339	return 0;	2371	return 0;
2340	}	2372	}
2341		2373
2342	const shstr &	2374	shstr_tmp
2343	object::kv_get (const shstr &key) const	2375	object::kv_get (shstr_tmp key) const
2344	{	2376	{
2345	for (key_value *kv = key_values; kv; kv = kv->next)	2377	for (key_value *kv = key_values; kv; kv = kv->next)
2346	if (kv->key == key)	2378	if (kv->key == key)
2347	return kv->value;	2379	return kv->value;
2348		2380
2349	return shstr_null;	2381	return shstr ();
2350	}	2382	}
2351		2383
2352	void	2384	void
2353	object::kv_set (const shstr &key, const shstr &value)	2385	object::kv_set (shstr_tmp key, shstr_tmp value)
2354	{	2386	{
2355	for (key_value *kv = key_values; kv; kv = kv->next)	2387	for (key_value *kv = key_values; kv; kv = kv->next)
2356	if (kv->key == key)	2388	if (kv->key == key)
2357	{	2389	{
2358	kv->value = value;	2390	kv->value = value;
…		…
2367		2399
2368	key_values = kv;	2400	key_values = kv;
2369	}	2401	}
2370		2402
2371	void	2403	void
2372	object::kv_del (const shstr &key)	2404	object::kv_del (shstr_tmp key)
2373	{	2405	{
2374	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2406	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2375	if ((*kvp)->key == key)	2407	if ((*kvp)->key == key)
2376	{	2408	{
2377	key_value kv = kvp;	2409	key_value kv = kvp;
…		…
2470	{	2502	{
2471	return map ? map->region (x, y)	2503	return map ? map->region (x, y)
2472	: region::default_region ();	2504	: region::default_region ();
2473	}	2505	}
2474		2506
2475	const materialtype_t *
2476	object::dominant_material () const
2477	{
2478	if (materialtype_t *mt = name_to_material (materialname))
2479	return mt;
2480
2481	return name_to_material (shstr_unknown);
2482	}
2483
2484	void	2507	void
2485	object::open_container (object *new_container)	2508	object::open_container (object *new_container)
2486	{	2509	{
2487	if (container == new_container)	2510	if (container == new_container)
2488	return;	2511	return;
…		…
2508	container = 0;	2531	container = 0;
2509		2532
2510	// client needs item update to make it work, client bug requires this to be separate	2533	// client needs item update to make it work, client bug requires this to be separate
2511	esrv_update_item (UPD_FLAGS, this, old_container);	2534	esrv_update_item (UPD_FLAGS, this, old_container);
2512		2535
2513	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2536	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2514	play_sound (sound_find ("chest_close"));	2537	play_sound (sound_find ("chest_close"));
2515	}	2538	}
2516		2539
2517	if (new_container)	2540	if (new_container)
2518	{	2541	{
…		…
2522	// TODO: this does not seem to serve any purpose anymore?	2545	// TODO: this does not seem to serve any purpose anymore?
2523	#if 0	2546	#if 0
2524	// insert the "Close Container" object.	2547	// insert the "Close Container" object.
2525	if (archetype *closer = new_container->other_arch)	2548	if (archetype *closer = new_container->other_arch)
2526	{	2549	{
2527	object *closer = arch_to_object (new_container->other_arch);	2550	object *closer = new_container->other_arch->instance ();
2528	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2551	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2529	new_container->insert (closer);	2552	new_container->insert (closer);
2530	}	2553	}
2531	#endif	2554	#endif
2532		2555
2533	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2556	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2534		2557
2535	// make sure the container is available, client bug requires this to be separate	2558	// make sure the container is available, client bug requires this to be separate
2536	esrv_send_item (this, new_container);	2559	esrv_send_item (this, new_container);
2537		2560
2538	new_container->flag [FLAG_APPLIED] = true;	2561	new_container->flag [FLAG_APPLIED] = true;
…		…
2546	// else if (!old_container->env && contr && contr->ns)	2569	// else if (!old_container->env && contr && contr->ns)
2547	// contr->ns->floorbox_reset ();	2570	// contr->ns->floorbox_reset ();
2548	}	2571	}
2549		2572
2550	object *	2573	object *
2551	object::force_find (const shstr name)	2574	object::force_find (shstr_tmp name)
2552	{	2575	{
2553	/* cycle through his inventory to look for the MARK we want to	2576	/* cycle through his inventory to look for the MARK we want to
2554	* place	2577	* place
2555	*/	2578	*/
2556	for (object *tmp = inv; tmp; tmp = tmp->below)	2579	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2558	return splay (tmp);	2581	return splay (tmp);
2559		2582
2560	return 0;	2583	return 0;
2561	}	2584	}
2562		2585
		2586	//-GPL
		2587
2563	void	2588	void
		2589	object::force_set_timer (int duration)
		2590	{
		2591	this->duration = 1;
		2592	this->speed_left = -1.f;
		2593
		2594	this->set_speed (duration ? 1.f / duration : 0.f);
		2595	}
		2596
		2597	object *
2564	object::force_add (const shstr name, int duration)	2598	object::force_add (shstr_tmp name, int duration)
2565	{	2599	{
2566	if (object *force = force_find (name))	2600	if (object *force = force_find (name))
2567	force->destroy ();	2601	force->destroy ();
2568		2602
2569	object *force = get_archetype (FORCE_NAME);	2603	object *force = get_archetype (FORCE_NAME);
2570		2604
2571	force->slaying = name;	2605	force->slaying = name;
2572	force->stats.food = 1;	2606	force->force_set_timer (duration);
2573	force->speed_left = -1.f;
2574
2575	force->set_speed (duration ? 1.f / duration : 0.f);
2576	force->flag [FLAG_IS_USED_UP] = true;
2577	force->flag [FLAG_APPLIED] = true;	2607	force->flag [FLAG_APPLIED] = true;
2578		2608
2579	insert (force);	2609	return insert (force);
2580	}	2610	}
2581		2611
2582	void	2612	void
2583	object::play_sound (faceidx sound)	2613	object::play_sound (faceidx sound) const
2584	{	2614	{
2585	if (!sound)	2615	if (!sound)
2586	return;	2616	return;
2587		2617
2588	if (flag [FLAG_REMOVED])	2618	if (is_on_map ())
		2619	map->play_sound (sound, x, y);
		2620	else if (object *pl = in_player ())
		2621	pl->contr->play_sound (sound);
		2622	}
		2623
		2624	void
		2625	object::say_msg (const char *msg) const
		2626	{
		2627	if (is_on_map ())
		2628	map->say_msg (msg, x, y);
		2629	else if (object *pl = in_player ())
		2630	pl->contr->play_sound (sound);
		2631	}
		2632
		2633	void
		2634	object::make_noise ()
		2635	{
		2636	// we do not model noise in the map, so instead put
		2637	// a temporary light into the noise source
		2638	// could use the map instead, but that's less reliable for our
		2639	// goal, which is to make invisibility a bit harder to exploit
		2640
		2641	// currently only works sensibly for players
		2642	if (!is_player ())
2589	return;	2643	return;
2590		2644
2591	if (env)	2645	// find old force, or create new one
2592	{	2646	object *force = force_find (shstr_noise_force);
2593	if (object *pl = in_player ())	2647
2594	pl->contr->play_sound (sound);	2648	if (force)
2595	}	2649	force->speed_left = -1.f; // patch old speed up
2596	else	2650	else
2597	map->play_sound (sound, x, y);	2651	{
2598	}	2652	force = archetype::get (shstr_noise_force);
2599		2653
		2654	force->slaying = shstr_noise_force;
		2655	force->stats.food = 1;
		2656	force->speed_left = -1.f;
		2657
		2658	force->set_speed (1.f / 4.f);
		2659	force->flag [FLAG_IS_USED_UP] = true;
		2660	force->flag [FLAG_APPLIED] = true;
		2661
		2662	insert (force);
		2663	}
		2664	}
		2665
		2666	void object::change_move_type (MoveType mt)
		2667	{
		2668	if (move_type == mt)
		2669	return;
		2670
		2671	if (is_on_map ())
		2672	{
		2673	// we are on the map, so handle move_on/off effects
		2674	remove ();
		2675	move_type = mt;
		2676	map->insert (this, x, y, this);
		2677	}
		2678	else
		2679	move_type = mt;
		2680	}
		2681

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.246 by root, Thu May 22 15:37:44 2008 UTC vs. Revision 1.320 by root, Wed Apr 7 19:54:44 2010 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.246 by root, Thu May 22 15:37:44 2008 UTC vs.
Revision 1.320 by root, Wed Apr 7 19:54:44 2010 UTC