ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.26 by root, Mon Sep 11 11:46:52 2006 UTC vs.
Revision 1.316 by root, Sun Mar 28 02:53:46 2010 UTC

1
2	/*	1	/*
3	* static char *rcsid_object_c =	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
4	* "$Id: object.C,v 1.26 2006/09/11 11:46:52 root Exp $";	3	*
5	*/	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
6
7	/*
8	CrossFire, A Multiplayer game for X-windows
9
10	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
11	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
12		7	*
13	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
14	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
15	the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
16	(at your option) any later version.	11	* option) any later version.
17		12	*
18	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,
19	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
20	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21	GNU General Public License for more details.	16	* GNU General Public License for more details.
22		17	*
23	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
24	along with this program; if not, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
25	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
26		21	*
27	The authors can be reached via e-mail at crossfire-devel@real-time.com	22	* The authors can be reached via e-mail to <support@deliantra.net>
28	*/	23	*/
29		24
30	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
31	sub/add_weight will transcend the environment updating the carrying
32	variable. */
33	#include <global.h>	25	#include <global.h>
34	#ifndef WIN32 /* ---win32 exclude headers */
35	# include <stdio.h>	26	#include <stdio.h>
36	# include <sys/types.h>	27	#include <sys/types.h>
37	# include <sys/uio.h>	28	#include <sys/uio.h>
38	#endif /* win32 */
39	#include <object.h>	29	#include <object.h>
40	#include <funcpoint.h>	30	#include <sproto.h>
41	#include <skills.h>
42	#include <loader.h>
43	int nrofallocobjects = 0;
44		31
45	object *objects; /* Pointer to the list of used objects */	32	#include <bitset>
46	object *active_objects; /* List of active objects that need to be processed */
47		33
48	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	34	UUID UUID::cur;
		35	static uint64_t seq_next_save;
		36	static const uint64 UUID_GAP = 1<<19;
		37	uint32_t mapspace::smellcount = 10000;
		38
		39	objectvec objects;
		40	activevec actives;
		41
		42	//+GPL
		43
		44	short freearr_x[SIZEOFFREE] = {
		45	0,
		46	0, 1, 1, 1, 0, -1, -1, -1,
		47	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
49	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	48	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
50	};	49	};
51	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	50	short freearr_y[SIZEOFFREE] = {
		51	0,
		52	-1, -1, 0, 1, 1, 1, 0, -1,
		53	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
52	-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
53	};
54	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,
55	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
56	};	55	};
57	int freedir[SIZEOFFREE] = {	56	int freedir[SIZEOFFREE] = {
58	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	57	0,
		58	1, 2, 3, 4, 5, 6, 7, 8,
		59	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
59	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
60	};	61	};
61		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
		70	static void
		71	write_uuid (uval64 skip, bool sync)
		72	{
		73	CALL_BEGIN (2);
		74	CALL_ARG_SV (newSVval64 (skip));
		75	CALL_ARG_SV (boolSV (sync));
		76	CALL_CALL ("cf::write_uuid", G_DISCARD);
		77	CALL_END;
		78	}
		79
		80	static void
		81	read_uuid ()
		82	{
		83	char filename[MAX_BUF];
		84
		85	sprintf (filename, "%s/uuid", settings.localdir);
		86
		87	seq_next_save = 0;
		88
		89	FILE *fp;
		90
		91	if (!(fp = fopen (filename, "r")))
		92	{
		93	if (errno == ENOENT)
		94	{
		95	LOG (llevInfo, "RESET uid to 1\n");
		96	UUID::cur.seq = 0;
		97	write_uuid (UUID_GAP, true);
		98	return;
		99	}
		100
		101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
		102	_exit (1);
		103	}
		104
		105	char buf [UUID::MAX_LEN];
		106	buf[0] = 0;
		107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
		110	{
		111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
		112	_exit (1);
		113	}
		114
		115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
		116
		117	write_uuid (UUID_GAP, true);
		118	fclose (fp);
		119	}
		120
		121	UUID
		122	UUID::gen ()
		123	{
		124	UUID uid;
		125
		126	uid.seq = ++cur.seq;
		127
		128	if (expect_false (cur.seq >= seq_next_save))
		129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
		134
		135	return uid;
		136	}
		137
		138	void
		139	UUID::init ()
		140	{
		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;
		207	}
		208
62	/* 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. */
63	static int	210	static bool
64	compare_ob_value_lists_one (const object *wants, const object *has)	211	compare_ob_value_lists_one (const object *wants, const object *has)
65	{	212	{
66	key_value *wants_field;
67
68	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	213	/* n-squared behaviour (see kv_get), but I'm hoping both
69	* objects with lists are rare, and lists stay short. If not, use a	214	* objects with lists are rare, and lists stay short. If not, use a
70	* different structure or at least keep the lists sorted...	215	* different structure or at least keep the lists sorted...
71	*/	216	*/
72		217
73	/* For each field in wants, */	218	/* For each field in wants, */
74	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	219	for (key_value *kv = wants->key_values; kv; kv = kv->next)
75	{	220	if (has->kv_get (kv->key) != kv->value)
76	key_value *has_field;	221	return false;
77
78	/* Look for a field in has with the same key. */
79	has_field = get_ob_key_link (has, wants_field->key);
80
81	if (has_field == NULL)
82	{
83	/* No field with that name. */
84	return FALSE;
85	}
86
87	/* Found the matching field. */
88	if (has_field->value != wants_field->value)
89	{
90	/* Values don't match, so this half of the comparison is false. */
91	return FALSE;
92	}
93
94	/* If we get here, we found a match. Now for the next field in wants. */
95	}
96		222
97	/* If we get here, every field in wants has a matching field in has. */	223	/* If we get here, every field in wants has a matching field in has. */
98	return TRUE;	224	return true;
99	}	225	}
100		226
101	/* Returns TRUE if ob1 has the same key_values as ob2. */	227	/* Returns TRUE if ob1 has the same key_values as ob2. */
102	static int	228	static bool
103	compare_ob_value_lists (const object *ob1, const object *ob2)	229	compare_ob_value_lists (const object *ob1, const object *ob2)
104	{	230	{
105	/* However, there may be fields in has which aren't partnered in wants,	231	/* However, there may be fields in has which aren't partnered in wants,
106	* so we need to run the comparison *twice*. :(	232	* so we need to run the comparison *twice*. :(
107	*/	233	*/
108	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	234	return compare_ob_value_lists_one (ob1, ob2)
		235	&& compare_ob_value_lists_one (ob2, ob1);
109	}	236	}
110		237
111	/* Function examines the 2 objects given to it, and returns true if	238	/* Function examines the 2 objects given to it, and returns true if
112	* they can be merged together.	239	* they can be merged together.
113	*	240	*
114	* Note that this function appears a lot longer than the macro it	241	* Note that this function appears a lot longer than the macro it
115	* replaces - this is mostly for clarity - a decent compiler should hopefully	242	* replaces - this is mostly for clarity - a decent compiler should hopefully
116	* reduce this to the same efficiency.	243	* reduce this to the same efficiency.
117	*	244	*
118	* Check nrof variable *before* calling CAN_MERGE()	245	* Check nrof variable *before* calling can_merge()
119	*	246	*
120	* Improvements made with merge: Better checking on potion, and also	247	* Improvements made with merge: Better checking on potion, and also
121	* check weight	248	* check weight
122	*/	249	*/
123
124	bool object::can_merge (object *ob1, object *ob2)	250	bool object::can_merge_slow (object *ob1, object *ob2)
125	{	251	{
126	/* A couple quicksanity checks */	252	/* A couple quick sanity checks */
127	if ((ob1 == ob2) || (ob1->type != ob2->type))	253	if (ob1 == ob2
		254	|| ob1->type != ob2->type
		255	|| ob1->value != ob2->value
		256	|| ob1->name != ob2->name
		257	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
128	return 0;	258	return 0;
129		259
130	if (ob1->speed != ob2->speed)	260	/* Do not merge objects if nrof would overflow, assume nrof
		261	* is always 0 .. 2**31-1 */
		262	if (ob1->nrof > 0x7fffffff - ob2->nrof)
131	return 0;	263	return 0;
132		264
133	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
134	* value could not be stored in a sint32 (which unfortunately sometimes is
135	* used to store nrof).
136	*/
137	if (ob1->nrof + ob2->nrof >= 1UL << 31)
138	return 0;
139
140	/* If the objects have been identified, set the BEEN_APPLIED flag.	265	/* If the objects have been identified, set the BEEN_APPLIED flag.
141	* 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
142	* 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
143	* are not equal - just if it has been identified, the been_applied	268	* are not equal - just if it has been identified, the been_applied
144	* flags lose any meaning.	269	* flags lose any meaning.
145	*/	270	*/
146	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	271	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
147	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	272	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
148		273
149	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	274	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
150	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	275	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
151		276
152		277	if (ob1->arch->archname != ob2->arch->archname
153	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something
154	* being locked in inventory should prevent merging.
155	* 0x4 in flags3 is CLIENT_SENT
156	*/
157	if ((ob1->arch != ob2->arch) ||
158	(ob1->flags[0] != ob2->flags[0]) ||
159	(ob1->flags[1] != ob2->flags[1]) ||
160	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
161	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
162	(ob1->name != ob2->name) ||	278	|| ob1->name != ob2->name
163	(ob1->title != ob2->title) ||	279	|| ob1->title != ob2->title
164	(ob1->msg != ob2->msg) ||	280	|| ob1->msg != ob2->msg
165	(ob1->weight != ob2->weight) ||	281	|| ob1->weight != ob2->weight
166	(memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||
167	(memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||
168	(ob1->attacktype != ob2->attacktype) ||	282	|| ob1->attacktype != ob2->attacktype
169	(ob1->magic != ob2->magic) ||	283	|| ob1->magic != ob2->magic
170	(ob1->slaying != ob2->slaying) ||	284	|| ob1->slaying != ob2->slaying
171	(ob1->skill != ob2->skill) ||	285	|| ob1->skill != ob2->skill
172	(ob1->value != ob2->value) ||	286	|| ob1->value != ob2->value
173	(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
174	(ob1->client_type != ob2->client_type) ||	289	|| ob1->client_type != ob2->client_type
175	(ob1->materialname != ob2->materialname) ||	290	|| ob1->material != ob2->material
176	(ob1->lore != ob2->lore) ||	291	|| ob1->lore != ob2->lore
177	(ob1->subtype != ob2->subtype) ||	292	|| ob1->subtype != ob2->subtype
178	(ob1->move_type != ob2->move_type) ||	293	|| ob1->move_type != ob2->move_type
179	(ob1->move_block != ob2->move_block) ||	294	|| ob1->move_block != ob2->move_block
180	(ob1->move_allow != ob2->move_allow) ||	295	|| ob1->move_allow != ob2->move_allow
181	(ob1->move_on != ob2->move_on) ||	296	|| ob1->move_on != ob2->move_on
182	(ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty))	297	|| ob1->move_off != ob2->move_off
		298	|| ob1->move_slow != ob2->move_slow
		299	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
		300	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		301	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
183	return 0;	302	return 0;
184		303
		304	if ((ob1->flag ^ ob2->flag)
		305	.reset (FLAG_INV_LOCKED)
		306	.reset (FLAG_REMOVED)
		307	.any ())
		308	return 0;
		309
185	/* This is really a spellbook check - really, we should	310	/* This is really a spellbook check - we should in general
186	* check all objects in the inventory.	311	* not merge objects with real inventories, as splitting them
		312	* is hard.
187	*/	313	*/
188	if (ob1->inv || ob2->inv)	314	if (ob1->inv || ob2->inv)
189	{	315	{
190	/* if one object has inventory but the other doesn't, not equiv */
191	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
192	return 0;
193
194	/* Now check to see if the two inventory objects could merge */
195	if (!CAN_MERGE (ob1->inv, ob2->inv))	316	if (!(ob1->inv && ob2->inv))
196	return 0;	317	return 0; /* inventories differ in length */
		318
		319	if (ob1->inv->below || ob2->inv->below)
		320	return 0; /* more than one object in inv */
		321
		322	if (!object::can_merge (ob1->inv, ob2->inv))
		323	return 0; /* inventory objects differ */
197		324
198	/* inventory ok - still need to check rest of this object to see	325	/* inventory ok - still need to check rest of this object to see
199	* if it is valid.	326	* if it is valid.
200	*/	327	*/
201	}	328	}
…		…
209		336
210	/* Note sure why the following is the case - either the object has to	337	/* Note sure why the following is the case - either the object has to
211	* be animated or have a very low speed. Is this an attempted monster	338	* be animated or have a very low speed. Is this an attempted monster
212	* check?	339	* check?
213	*/	340	*/
214	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	341	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
215	return 0;	342	return 0;
216		343
217	switch (ob1->type)	344	switch (ob1->type)
218	{	345	{
219	case SCROLL:	346	case SCROLL:
220	if (ob1->level != ob2->level)	347	if (ob1->level != ob2->level)
221	return 0;	348	return 0;
222	break;	349	break;
223	}	350	}
224		351
225	if (ob1->key_values != NULL || ob2->key_values != NULL)	352	if (ob1->key_values || ob2->key_values)
226	{	353	{
227	/* At least one of these has key_values. */	354	/* At least one of these has key_values. */
228	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	355	if ((!ob1->key_values) != (!ob2->key_values))
229	/* One has fields, but the other one doesn't. */	356	return 0; /* One has fields, but the other one doesn't. */
		357
		358	if (!compare_ob_value_lists (ob1, ob2))
230	return 0;	359	return 0;
231	else if (!compare_ob_value_lists (ob1, ob2))
232	return 0;
233	}	360	}
234		361
235	//TODO: generate an event or call into perl for additional checks
236	if (ob1->self || ob2->self)	362	if (ob1->self || ob2->self)
237	{	363	{
238	ob1->optimise ();	364	ob1->optimise ();
239	ob2->optimise ();	365	ob2->optimise ();
240		366
241	if (ob1->self || ob2->self)	367	if (ob1->self || ob2->self)
		368	{
		369	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		370	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		371
		372	if (k1 != k2)
242	return 0;	373	return 0;
		374
		375	if (k1 == 0)
		376	return 1;
		377
		378	if (!cfperl_can_merge (ob1, ob2))
		379	return 0;
		380	}
243	}	381	}
244		382
245	/* Everything passes, must be OK. */	383	/* Everything passes, must be OK. */
246	return 1;	384	return 1;
247	}	385	}
248		386
		387	// find player who can see this object
		388	object *
		389	object::visible_to () const
		390	{
		391	if (client_visible () && !flag [FLAG_REMOVED])
		392	{
		393	// see if we are in a container of sorts
		394	if (env)
		395	{
		396	// the player inventory itself is always visible
		397	if (env->is_player ())
		398	return env;
		399
		400	// else a player could have our env open
		401	object *envest = env->outer_env_or_self ();
		402
		403	// the player itself is always on a map, so we will find him here
		404	// even if our inv is in a player.
		405	if (envest->is_on_map ())
		406	if (object *pl = envest->ms ().player ())
		407	if (pl->container_ () == env)
		408	return pl;
		409	}
		410	else
		411	{
		412	// maybe there is a player standing on the same mapspace
		413	// this will catch the case where "this" is a player
		414	if (object *pl = ms ().player ())
		415	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		416	|| pl->container_ () == this)
		417	return pl;
		418	}
		419	}
		420
		421	return 0;
		422	}
		423
		424	// adjust weight per container type ("of holding")
		425	static sint32
		426	weight_adjust_for (object *op, sint32 weight)
		427	{
		428	return op->type == CONTAINER
		429	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		430	: weight;
		431	}
		432
249	/*	433	/*
		434	* adjust_weight(object, weight) adds the specified weight to an object,
		435	* and also updates how much the environment(s) is/are carrying.
		436	*/
		437	static void
		438	adjust_weight (object *op, sint32 weight)
		439	{
		440	while (op)
		441	{
		442	// adjust by actual difference to account for rounding errors
		443	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		444	weight = weight_adjust_for (op, op->carrying)
		445	- weight_adjust_for (op, op->carrying - weight);
		446
		447	if (!weight)
		448	return;
		449
		450	op->carrying += weight;
		451
		452	if (object *pl = op->visible_to ())
		453	if (pl != op) // player is handled lazily
		454	esrv_update_item (UPD_WEIGHT, pl, op);
		455
		456	op = op->env;
		457	}
		458	}
		459
		460	/*
250	* sum_weight() is a recursive function which calculates the weight	461	* this is a recursive function which calculates the weight
251	* an object is carrying. It goes through in figures out how much	462	* an object is carrying. It goes through op and figures out how much
252	* containers are carrying, and sums it up.	463	* containers are carrying, and sums it up.
253	*/	464	*/
254	signed long	465	void
255	sum_weight (object *op)	466	object::update_weight ()
256	{	467	{
257	signed long sum;	468	sint32 sum = 0;
258	object *inv;
259		469
260	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	470	for (object *op = inv; op; op = op->below)
261	{	471	{
262	if (inv->inv)	472	if (op->inv)
263	sum_weight (inv);	473	op->update_weight ();
264	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	474
		475	sum += op->total_weight ();
		476	}
		477
		478	sum = weight_adjust_for (this, sum);
		479
		480	if (sum != carrying)
265	}	481	{
266	if (op->type == CONTAINER && op->stats.Str)
267	sum = (sum * (100 - op->stats.Str)) / 100;
268	if (op->carrying != sum)
269	op->carrying = sum;	482	carrying = sum;
270	return sum;
271	}
272		483
273	/**	484	if (object *pl = visible_to ())
274	* Return the outermost environment object for a given object.	485	if (pl != this) // player is handled lazily
275	*/	486	esrv_update_item (UPD_WEIGHT, pl, this);
276
277	object *
278	object_get_env_recursive (object *op)
279	{
280	while (op->env != NULL)
281	op = op->env;
282	return op;
283	}
284
285	/*
286	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
287	* a better check. We basically keeping traversing up until we can't
288	* or find a player.
289	*/
290
291	object *
292	is_player_inv (object *op)
293	{
294	for (; op != NULL && op->type != PLAYER; op = op->env)
295	if (op->env == op)
296	op->env = NULL;
297	return op;
298	}
299
300	/*
301	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
302	* Some error messages.
303	* The result of the dump is stored in the static global errmsg array.
304	*/
305
306	void
307	dump_object2 (object *op)
308	{
309	errmsg[0] = 0;
310	return;
311	//TODO//D#d#
312	#if 0
313	char *cp;
314
315	/* object *tmp;*/
316
317	if (op->arch != NULL)
318	{	487	}
319	strcat (errmsg, "arch ");
320	strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
321	strcat (errmsg, "\n");
322	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
323	strcat (errmsg, cp);
324	# if 0
325	/* Don't dump player diffs - they are too long, mostly meaningless, and
326	* will overflow the buffer.
327	* Changed so that we don't dump inventory either. This may
328	* also overflow the buffer.
329	*/
330	if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
331	strcat (errmsg, cp);
332	for (tmp = op->inv; tmp; tmp = tmp->below)
333	dump_object2 (tmp);
334	# endif
335	strcat (errmsg, "end\n");
336	}
337	else
338	{
339	strcat (errmsg, "Object ");
340	if (op->name == NULL)
341	strcat (errmsg, "(null)");
342	else
343	strcat (errmsg, op->name);
344	strcat (errmsg, "\n");
345	# if 0
346	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
347	strcat (errmsg, cp);
348	for (tmp = op->inv; tmp; tmp = tmp->below)
349	dump_object2 (tmp);
350	# endif
351	strcat (errmsg, "end\n");
352	}
353	#endif
354	}	488	}
355		489
356	/*	490	/*
357	* Dumps an object. Returns output in the static global errmsg array.	491	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
358	*/	492	*/
359		493	char *
360	void
361	dump_object (object *op)	494	dump_object (object *op)
362	{	495	{
363	if (op == NULL)	496	if (!op)
364	{	497	return strdup ("[NULLOBJ]");
365	strcpy (errmsg, "[NULL pointer]");
366	return;
367	}
368	errmsg[0] = '\0';
369	dump_object2 (op);
370	}
371		498
372	void	499	object_freezer freezer;
373	dump_all_objects (void)	500	op->write (freezer);
374	{	501	return freezer.as_string ();
375	object *op;
376
377	for (op = objects; op != NULL; op = op->next)
378	{
379	dump_object (op);
380	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
381	}
382	}	502	}
383		503
384	/*	504	char *
385	* get_nearest_part(multi-object, object 2) returns the part of the	505	object::as_string ()
386	* multi-object 1 which is closest to the second object.
387	* If it's not a multi-object, it is returned.
388	*/
389
390	object *
391	get_nearest_part (object *op, const object *pl)
392	{	506	{
393	object *tmp, *closest;	507	return dump_object (this);
394	int last_dist, i;
395
396	if (op->more == NULL)
397	return op;
398	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)
399	if ((i = distance (tmp, pl)) < last_dist)
400	closest = tmp, last_dist = i;
401	return closest;
402	}	508	}
403		509
404	/*	510	/*
405	* 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.
		512	* VERRRY slow.
406	*/	513	*/
407
408	object *	514	object *
409	find_object (tag_t i)	515	find_object (tag_t i)
410	{	516	{
411	object *op;	517	for_all_objects (op)
412
413	for (op = objects; op != NULL; op = op->next)
414	if (op->count == i)	518	if (op->count == i)
415	break;
416	return op;	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)
		534	return op;
		535
		536	return 0;
417	}	537	}
418		538
419	/*	539	/*
420	* Returns the first object which has a name equal to the argument.	540	* Returns the first object which has a name equal to the argument.
421	* Used only by the patch command, but not all that useful.	541	* Used only by the patch command, but not all that useful.
422	* Enables features like "patch <name-of-other-player> food 999"	542	* Enables features like "patch <name-of-other-player> food 999"
423	*/	543	*/
424
425	object *	544	object *
426	find_object_name (const char *str)	545	find_object_name (const char *str)
427	{	546	{
428	const char *name = shstr::find (str);	547	shstr_cmp str_ (str);
429	object *op;
430		548
431	for (op = objects; op != NULL; op = op->next)	549	if (str_)
		550	for_all_objects (op)
432	if (&op->name == name)	551	if (op->name == str_)
433	break;	552	return op;
434		553
435	return op;	554	return 0;
436	}
437
438	void
439	free_all_object_data ()
440	{
441	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
442	}
443
444	/*
445	* Returns the object which this object marks as being the owner.
446	* A id-scheme is used to avoid pointing to objects which have been
447	* freed and are now reused. If this is detected, the owner is
448	* set to NULL, and NULL is returned.
449	* Changed 2004-02-12 - if the player is setting at the play again
450	* prompt, he is removed, and we don't want to treat him as an owner of
451	* anything, so check removed flag. I don't expect that this should break
452	* anything - once an object is removed, it is basically dead anyways.
453	*/
454
455	object *
456	get_owner (object *op)
457	{
458	if (op->owner == NULL)
459	return NULL;
460
461	if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount)
462	return op->owner;
463
464	op->owner = NULL;
465	op->ownercount = 0;
466	return NULL;
467	}
468
469	void
470	clear_owner (object *op)
471	{
472	if (!op)
473	return;
474
475	if (op->owner && op->ownercount == op->owner->count)
476	op->owner->refcount--;
477
478	op->owner = NULL;
479	op->ownercount = 0;
480	}	555	}
481		556
482	/*	557	/*
483	* Sets the owner and sets the skill and exp pointers to owner's current	558	* Sets the owner and sets the skill and exp pointers to owner's current
484	* skill and experience objects.	559	* skill and experience objects.
485	*/	560	* ACTUALLY NO! investigate! TODO
486	void
487	set_owner (object *op, object *owner)
488	{
489	if (owner == NULL || op == NULL)
490	return;
491
492	/* next line added to allow objects which own objects */
493	/* Add a check for ownercounts in here, as I got into an endless loop
494	* with the fireball owning a poison cloud which then owned the
495	* fireball. I believe that was caused by one of the objects getting
496	* freed and then another object replacing it. Since the ownercounts
497	* didn't match, this check is valid and I believe that cause is valid.
498	*/	561	*/
499	while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count)	562	void
		563	object::set_owner (object *owner)
		564	{
		565	// allow objects which own objects
		566	if (owner)
		567	while (owner->owner)
500	owner = owner->owner;	568	owner = owner->owner;
501		569
502	/* IF the owner still has an owner, we did not resolve to a final owner.	570	if (flag [FLAG_FREED])
503	* so lets not add to that.
504	*/
505	if (owner->owner)
506	return;
507
508	op->owner = owner;
509
510	op->ownercount = owner->count;
511	owner->refcount++;
512	}
513
514	/* Set the owner to clone's current owner and set the skill and experience
515	* objects to clone's objects (typically those objects that where the owner's
516	* current skill and experience objects at the time when clone's owner was
517	* set - not the owner's current skill and experience objects).
518	*
519	* Use this function if player created an object (e.g. fire bullet, swarm
520	* spell), and this object creates further objects whose kills should be
521	* accounted for the player's original skill, even if player has changed
522	* skills meanwhile.
523	*/
524	void
525	copy_owner (object *op, object *clone)
526	{
527	object *owner = get_owner (clone);
528
529	if (owner == NULL)
530	{	571	{
531	/* players don't have owners - they own themselves. Update	572	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
532	* as appropriate.
533	*/
534	if (clone->type == PLAYER)
535	owner = clone;
536	else
537	return;	573	return;
		574	}
		575
		576	this->owner = owner;
		577	}
		578
		579	int
		580	object::slottype () const
		581	{
		582	if (type == SKILL)
538	}	583	{
		584	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		585	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		586	}
		587	else
		588	{
		589	if (slot [body_combat].info) return slot_combat;
		590	if (slot [body_range ].info) return slot_ranged;
		591	}
		592
		593	return slot_none;
		594	}
539		595
540	set_owner (op, owner);	596	bool
		597	object::change_weapon (object *ob)
		598	{
		599	if (current_weapon == ob)
		600	return true;
		601
		602	if (chosen_skill)
		603	chosen_skill->flag [FLAG_APPLIED] = false;
		604
		605	current_weapon = ob;
		606	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		607
		608	if (chosen_skill)
		609	chosen_skill->flag [FLAG_APPLIED] = true;
		610
		611	update_stats ();
		612
		613	if (ob)
		614	{
		615	// now check wether any body locations became invalid, in which case
		616	// we cannot apply the weapon at the moment.
		617	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		618	if (slot[i].used < 0)
		619	{
		620	if (chosen_skill)
		621	chosen_skill->flag [FLAG_APPLIED] = false;
		622
		623	current_weapon = chosen_skill = 0;
		624	update_stats ();
		625
		626	new_draw_info_format (NDI_UNIQUE, 0, this,
		627	"You try to balance all your items at once, "
		628	"but the %s is just too much for your body. "
		629	"[You need to unapply some items first - use the 'body' command to see "
		630	"how many items you can wear on a specific body part.]", &ob->name);
		631	return false;
		632	}
		633
		634	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		635	}
		636	else
		637	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		638
		639	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		640	{
		641	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		642	&name, ob->debug_desc ());
		643	return false;
		644	}
		645
		646	return true;
541	}	647	}
542		648
543	/* Zero the key_values on op, decrementing the shared-string	649	/* Zero the key_values on op, decrementing the shared-string
544	* refcounts and freeing the links.	650	* refcounts and freeing the links.
545	*/	651	*/
546	static void	652	static void
547	free_key_values (object *op)	653	free_key_values (object *op)
548	{	654	{
549	for (key_value *i = op->key_values; i != 0;)	655	for (key_value *i = op->key_values; i; )
550	{	656	{
551	key_value *next = i->next;	657	key_value *next = i->next;
552	delete i;	658	delete i;
553		659
554	i = next;	660	i = next;
555	}	661	}
556		662
557	op->key_values = 0;	663	op->key_values = 0;
558	}	664	}
559		665
560	void object::clear ()
561	{
562	attachable_base::clear ();
563
564	free_key_values (this);
565
566	clear_owner (this);
567
568	name = 0;
569	name_pl = 0;
570	title = 0;
571	race = 0;
572	slaying = 0;
573	skill = 0;
574	msg = 0;
575	lore = 0;
576	custom_name = 0;
577	materialname = 0;
578
579	memset (static_cast < object_pod * >(this), 0, sizeof (object_pod));
580
581	SET_FLAG (this, FLAG_REMOVED);
582	}
583
584	void object::clone (object *destination)
585	{
586	*(object_copy *) destination = *this;
587	*(object_pod *) destination = *this;
588
589	if (self || cb)
590	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
591	}
592
593	/*	666	/*
594	* clear_object() frees everything allocated by an object, and also
595	* clears all variables and flags to default settings.
596	*/
597
598	void
599	clear_object (object *op)
600	{
601	op->clear ();
602
603	op->contr = NULL;
604	op->below = NULL;
605	op->above = NULL;
606	op->inv = NULL;
607	op->container = NULL;
608	op->env = NULL;
609	op->more = NULL;
610	op->head = NULL;
611	op->map = NULL;
612	op->refcount = 0;
613	op->active_next = NULL;
614	op->active_prev = NULL;
615	/* What is not cleared is next, prev, and count */
616
617	op->expmul = 1.0;
618	op->face = blank_face;
619	op->attacked_by_count = -1;
620
621	if (settings.casting_time)
622	op->casting_time = -1;
623	}
624
625	/*
626	* copy object first frees everything allocated by the second object,	667	* copy_to first frees everything allocated by the dst object,
627	* and then copies the contends of the first object into the second	668	* and then copies the contents of itself into the second
628	* object, allocating what needs to be allocated. Basically, any	669	* object, allocating what needs to be allocated. Basically, any
629	* data that is malloc'd needs to be re-malloc/copied. Otherwise,	670	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
630	* if the first object is freed, the pointers in the new object	671	* if the first object is freed, the pointers in the new object
631	* will point at garbage.	672	* will point at garbage.
632	*/	673	*/
633
634	void	674	void
635	copy_object (object *op2, object *op)	675	object::copy_to (object *dst)
636	{	676	{
637	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	677	dst->remove ();
638	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	678	*(object_copy *)dst = *this;
639		679	dst->flag [FLAG_REMOVED] = true;
640	op2->clone (op);
641
642	if (is_freed)
643	SET_FLAG (op, FLAG_FREED);
644	if (is_removed)
645	SET_FLAG (op, FLAG_REMOVED);
646
647	if (op2->speed < 0)
648	op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0;
649		680
650	/* Copy over key_values, if any. */	681	/* Copy over key_values, if any. */
651	if (op2->key_values)	682	if (key_values)
652	{	683	{
653	key_value *tail = 0;	684	key_value *tail = 0;
654	key_value *i;
655
656	op->key_values = 0;	685	dst->key_values = 0;
657		686
658	for (i = op2->key_values; i; i = i->next)	687	for (key_value *i = key_values; i; i = i->next)
659	{	688	{
660	key_value *new_link = new key_value;	689	key_value *new_link = new key_value;
661		690
662	new_link->next = 0;	691	new_link->next = 0;
663	new_link->key = i->key;	692	new_link->key = i->key;
664	new_link->value = i->value;	693	new_link->value = i->value;
665		694
666	/* Try and be clever here, too. */	695	/* Try and be clever here, too. */
667	if (!op->key_values)	696	if (!dst->key_values)
668	{	697	{
669	op->key_values = new_link;	698	dst->key_values = new_link;
670	tail = new_link;	699	tail = new_link;
671	}	700	}
672	else	701	else
673	{	702	{
674	tail->next = new_link;	703	tail->next = new_link;
675	tail = new_link;	704	tail = new_link;
676	}	705	}
677	}	706	}
678	}	707	}
679		708
680	update_ob_speed (op);	709	dst->activate ();
		710	}
		711
		712	void
		713	object::instantiate ()
		714	{
		715	if (!uuid.seq) // HACK
		716	uuid = UUID::gen ();
		717
		718	// TODO: unclean state changes, should nt be done in copy_to AND instantiate
		719	if (flag [FLAG_RANDOM_SPEED] && speed)
		720	speed_left = - speed - rndm (); // TODO animation
		721	else
		722	speed_left = -1.;
		723
		724	/* copy the body_info to the body_used - this is only really
		725	* need for monsters, but doesn't hurt to do it for everything.
		726	* by doing so, when a monster is created, it has good starting
		727	* values for the body_used info, so when items are created
		728	* for it, they can be properly equipped.
		729	*/
		730	for (int i = NUM_BODY_LOCATIONS; i--; )
		731	slot[i].used = slot[i].info;
		732
		733	attachable::instantiate ();
		734	}
		735
		736	object *
		737	object::clone ()
		738	{
		739	object *neu = create ();
		740	copy_to (neu);
		741
		742	// TODO: unclean state changes, should not be done in clone AND instantiate
		743	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		744	neu->speed_left = - neu->speed - rndm (); // TODO animation
		745
		746	neu->map = map; // not copied by copy_to
		747	return neu;
681	}	748	}
682		749
683	/*	750	/*
684	* If an object with the IS_TURNABLE() flag needs to be turned due	751	* If an object with the IS_TURNABLE() flag needs to be turned due
685	* to the closest player being on the other side, this function can	752	* to the closest player being on the other side, this function can
686	* be called to update the face variable, _and_ how it looks on the map.	753	* be called to update the face variable, _and_ how it looks on the map.
687	*/	754	*/
688
689	void	755	void
690	update_turn_face (object *op)	756	update_turn_face (object *op)
691	{	757	{
692	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	758	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
693	return;	759	return;
		760
694	SET_ANIMATION (op, op->direction);	761	SET_ANIMATION (op, op->direction);
695	update_object (op, UP_OBJ_FACE);	762	update_object (op, UP_OBJ_FACE);
696	}	763	}
697		764
698	/*	765	/*
699	* Updates the speed of an object. If the speed changes from 0 to another	766	* Updates the speed of an object. If the speed changes from 0 to another
700	* value, or vice versa, then add/remove the object from the active list.	767	* value, or vice versa, then add/remove the object from the active list.
701	* This function needs to be called whenever the speed of an object changes.	768	* This function needs to be called whenever the speed of an object changes.
702	*/	769	*/
703
704	void	770	void
705	update_ob_speed (object *op)	771	object::set_speed (float speed)
706	{	772	{
707	extern int arch_init;	773	this->speed = speed;
708		774
709	/* No reason putting the archetypes objects on the speed list,	775	if (has_active_speed ())
710	* since they never really need to be updated.	776	activate ();
711	*/
712
713	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
714	{
715	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);
716	#ifdef MANY_CORES
717	abort ();
718	#else
719	op->speed = 0;
720	#endif
721	}
722	if (arch_init)
723	{
724	return;
725	}
726	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
727	{
728	/* If already on active list, don't do anything */
729	if (op->active_next || op->active_prev || op == active_objects)
730	return;
731
732	/* process_events() expects us to insert the object at the beginning
733	* of the list. */
734	op->active_next = active_objects;
735	if (op->active_next != NULL)
736	op->active_next->active_prev = op;
737	active_objects = op;
738	}
739	else	777	else
740	{	778	deactivate ();
741	/* If not on the active list, nothing needs to be done */
742	if (!op->active_next && !op->active_prev && op != active_objects)
743	return;
744
745	if (op->active_prev == NULL)
746	{
747	active_objects = op->active_next;
748	if (op->active_next != NULL)
749	op->active_next->active_prev = NULL;
750	}
751	else
752	{
753	op->active_prev->active_next = op->active_next;
754	if (op->active_next)
755	op->active_next->active_prev = op->active_prev;
756	}
757	op->active_next = NULL;
758	op->active_prev = NULL;
759	}
760	}	779	}
761		780
762	/* This function removes object 'op' from the list of active
763	* objects.
764	* This should only be used for style maps or other such
765	* reference maps where you don't want an object that isn't
766	* in play chewing up cpu time getting processed.
767	* The reverse of this is to call update_ob_speed, which
768	* will do the right thing based on the speed of the object.
769	*/
770	void
771	remove_from_active_list (object *op)
772	{
773	/* If not on the active list, nothing needs to be done */
774	if (!op->active_next && !op->active_prev && op != active_objects)
775	return;
776
777	if (op->active_prev == NULL)
778	{
779	active_objects = op->active_next;
780	if (op->active_next != NULL)
781	op->active_next->active_prev = NULL;
782	}
783	else
784	{
785	op->active_prev->active_next = op->active_next;
786	if (op->active_next)
787	op->active_next->active_prev = op->active_prev;
788	}
789	op->active_next = NULL;
790	op->active_prev = NULL;
791	}
792
793	/*	781	/*
794	* update_object() updates the array which represents the map.	782	* update_object() updates the the map.
795	* It takes into account invisible objects (and represent squares covered	783	* It takes into account invisible objects (and represent squares covered
796	* by invisible objects by whatever is below them (unless it's another	784	* by invisible objects by whatever is below them (unless it's another
797	* invisible object, etc...)	785	* invisible object, etc...)
798	* If the object being updated is beneath a player, the look-window	786	* If the object being updated is beneath a player, the look-window
799	* of that player is updated (this might be a suboptimal way of	787	* of that player is updated (this might be a suboptimal way of
800	* updating that window, though, since update_object() is called _often_)	788	* updating that window, though, since update_object() is called _often_)
801	*	789	*
802	* action is a hint of what the caller believes need to be done.	790	* action is a hint of what the caller believes need to be done.
803	* For example, if the only thing that has changed is the face (due to
804	* an animation), we don't need to call update_position until that actually
805	* comes into view of a player. OTOH, many other things, like addition/removal
806	* of walls or living creatures may need us to update the flags now.
807	* current action are:	791	* current action are:
808	* UP_OBJ_INSERT: op was inserted	792	* UP_OBJ_INSERT: op was inserted
809	* UP_OBJ_REMOVE: op was removed	793	* UP_OBJ_REMOVE: op was removed
810	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	794	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
811	* as that is easier than trying to look at what may have changed.	795	* as that is easier than trying to look at what may have changed.
812	* UP_OBJ_FACE: only the objects face has changed.	796	* UP_OBJ_FACE: only the objects face has changed.
813	*/	797	*/
814
815	void	798	void
816	update_object (object *op, int action)	799	update_object (object *op, int action)
817	{	800	{
818	int update_now = 0, flags;	801	if (!op)
819	MoveType move_on, move_off, move_block, move_slow;
820
821	if (op == NULL)
822	{	802	{
823	/* this should never happen */	803	/* this should never happen */
824	LOG (llevDebug, "update_object() called for NULL object.\n");	804	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
825	return;	805	return;
826	}	806	}
827		807
828	if (op->env != NULL)	808	if (!op->is_on_map ())
829	{	809	{
830	/* Animation is currently handled by client, so nothing	810	/* Animation is currently handled by client, so nothing
831	* to do in this case.	811	* to do in this case.
832	*/	812	*/
833	return;	813	return;
834	}	814	}
835		815
836	/* If the map is saving, don't do anything as everything is
837	* going to get freed anyways.
838	*/
839	if (!op->map || op->map->in_memory == MAP_SAVING)
840	return;
841
842	/* make sure the object is within map boundaries */	816	/* make sure the object is within map boundaries */
843	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	817	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
844	{	818	{
845	LOG (llevError, "update_object() called for object out of map!\n");	819	LOG (llevError, "update_object() called for object out of map!\n");
846	#ifdef MANY_CORES	820	#ifdef MANY_CORES
847	abort ();	821	abort ();
848	#endif	822	#endif
849	return;	823	return;
850	}	824	}
851		825
852	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	826	mapspace &m = op->ms ();
853	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
854	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
855	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
856	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
857	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
858		827
		828	if (!(m.flags_ & P_UPTODATE))
		829	/* nop */;
859	if (action == UP_OBJ_INSERT)	830	else if (action == UP_OBJ_INSERT)
860	{	831	{
		832	#if 0
		833	// this is likely overkill, TODO: revisit (schmorp)
861	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	834	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
862	update_now = 1;
863
864	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	835	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
865	update_now = 1;	836	|| (op->is_player () && !(m.flags_ & P_PLAYER))
866		837	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		838	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
867	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	839	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
868	update_now = 1;
869
870	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
871	update_now = 1;
872
873	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
874	update_now = 1;
875
876	if ((move_on | op->move_on) != move_on)	840	|| (m.move_on | op->move_on ) != m.move_on
877	update_now = 1;
878
879	if ((move_off | op->move_off) != move_off)	841	|| (m.move_off | op->move_off ) != m.move_off
880	update_now = 1;	842	|| (m.move_slow | op->move_slow) != m.move_slow
881
882	/* This isn't perfect, but I don't expect a lot of objects to	843	/* This isn't perfect, but I don't expect a lot of objects to
883	* to have move_allow right now.	844	* have move_allow right now.
884	*/	845	*/
885	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	846	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
886	update_now = 1;	847	m.invalidate ();
887		848	#else
888	if ((move_slow | op->move_slow) != move_slow)	849	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
889	update_now = 1;	850	m.invalidate ();
		851	#endif
890	}	852	}
891	/* if the object is being removed, we can't make intelligent	853	/* if the object is being removed, we can't make intelligent
892	* decisions, because remove_ob can't really pass the object	854	* decisions, because remove_ob can't really pass the object
893	* that is being removed.	855	* that is being removed.
		856	*/
		857	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
		858	m.invalidate ();
		859	else if (action == UP_OBJ_FACE)
		860	/* Nothing to do for that case */ ;
		861	else
		862	LOG (llevError, "update_object called with invalid action: %d\n", action);
		863
		864	if (op->more)
		865	update_object (op->more, action);
		866	}
		867
		868	object::object ()
		869	{
		870	SET_FLAG (this, FLAG_REMOVED);
		871
		872	//expmul = 1.0; declared const for the time being
		873	face = blank_face;
		874	material = MATERIAL_NULL;
		875	}
		876
		877	object::~object ()
		878	{
		879	unlink ();
		880
		881	free_key_values (this);
		882	}
		883
		884	static int object_count;
		885
		886	void object::link ()
		887	{
		888	assert (!index);//D
		889	uuid = UUID::gen ();
		890	count = ++object_count;
		891
		892	refcnt_inc ();
		893	objects.insert (this);
		894	}
		895
		896	void object::unlink ()
		897	{
		898	if (!index)
		899	return;
		900
		901	objects.erase (this);
		902	refcnt_dec ();
		903	}
		904
		905	void
		906	object::activate ()
		907	{
		908	/* If already on active list, don't do anything */
		909	if (active)
		910	return;
		911
		912	if (has_active_speed ())
		913	{
		914	if (flag [FLAG_FREED])
		915	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		916
		917	actives.insert (this);
		918	}
		919	}
		920
		921	void
		922	object::activate_recursive ()
		923	{
		924	activate ();
		925
		926	for (object *op = inv; op; op = op->below)
		927	op->activate_recursive ();
		928	}
		929
		930	/* This function removes object 'op' from the list of active
		931	* objects.
		932	* This should only be used for style maps or other such
		933	* reference maps where you don't want an object that isn't
		934	* in play chewing up cpu time getting processed.
		935	* The reverse of this is to call update_ob_speed, which
		936	* will do the right thing based on the speed of the object.
		937	*/
		938	void
		939	object::deactivate ()
		940	{
		941	/* If not on the active list, nothing needs to be done */
		942	if (!active)
		943	return;
		944
		945	actives.erase (this);
		946	}
		947
		948	void
		949	object::deactivate_recursive ()
		950	{
		951	for (object *op = inv; op; op = op->below)
		952	op->deactivate_recursive ();
		953
		954	deactivate ();
		955	}
		956
		957	void
		958	object::set_flag_inv (int flag, int value)
		959	{
		960	for (object *op = inv; op; op = op->below)
		961	{
		962	op->flag [flag] = value;
		963	op->set_flag_inv (flag, value);
		964	}
		965	}
		966
		967	/*
		968	* Remove and free all objects in the inventory of the given object.
		969	* object.c ?
		970	*/
		971	void
		972	object::destroy_inv (bool drop_to_ground)
		973	{
		974	// need to check first, because the checks below might segfault
		975	// as we might be on an invalid mapspace and crossfire code
		976	// is too buggy to ensure that the inventory is empty.
		977	// corollary: if you create arrows etc. with stuff in its inventory,
		978	// cf will crash below with off-map x and y
		979	if (!inv)
		980	return;
		981
		982	/* Only if the space blocks everything do we not process -
		983	* if some form of movement is allowed, let objects
		984	* drop on that space.
894	*/	985	*/
895	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	986	if (!drop_to_ground
896	{	987	|| !map
897	update_now = 1;	988	|| map->in_memory != MAP_ACTIVE
		989	|| map->no_drop
		990	|| ms ().move_block == MOVE_ALL)
898	}	991	{
899	else if (action == UP_OBJ_FACE)	992	while (inv)
900	{	993	inv->destroy ();
901	/* Nothing to do for that case */
902	}	994	}
903	else	995	else
904	{	996	{ /* Put objects in inventory onto this space */
905	LOG (llevError, "update_object called with invalid action: %d\n", action);	997	while (inv)
906	}
907
908	if (update_now)
909	{
910	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
911	update_position (op->map, op->x, op->y);
912	}
913
914	if (op->more != NULL)
915	update_object (op->more, action);
916	}
917
918	static unordered_vector<object *> mortals;
919	static std::vector<object *> freed;
920
921	void object::free_mortals ()
922	{
923	for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end (); )
924	if (!(*i)->refcount)
925	{	998	{
926	freed.push_back (*i);	999	object *op = inv;
927	mortals.erase (i);	1000
		1001	if (op->flag [FLAG_STARTEQUIP]
		1002	|| op->flag [FLAG_NO_DROP]
		1003	|| op->type == RUNE
		1004	|| op->type == TRAP
		1005	|| op->flag [FLAG_IS_A_TEMPLATE]
		1006	|| op->flag [FLAG_DESTROY_ON_DEATH])
		1007	op->destroy ();
		1008	else
		1009	map->insert (op, x, y);
928	}	1010	}
929	else
930	++i;
931	}
932
933	object::object ()
934	{
935	SET_FLAG (this, FLAG_REMOVED);
936
937	expmul = 1.0;
938	face = blank_face;
939	attacked_by_count = -1;
940	}
941
942	object::~object ()
943	{
944	free_key_values (this);
945	}
946
947	void object::link ()
948	{
949	count = ++ob_count;
950
951	prev = 0;
952	next = objects;
953
954	if (objects)
955	objects->prev = this;
956
957	objects = this;
958	}
959
960	void object::unlink ()
961	{
962	count = 0;
963
964	/* Remove this object from the list of used objects */
965	if (prev)
966	{	1011	}
967	prev->next = next;
968	prev = 0;
969	}
970
971	if (next)
972	{
973	next->prev = prev;
974	next = 0;
975	}
976
977	if (this == objects)
978	objects = next;
979	}	1012	}
980		1013
981	object *object::create ()	1014	object *object::create ()
982	{	1015	{
983	object *op;
984
985	if (freed.empty ())
986	op = new object;	1016	object *op = new object;
987	else
988	{
989	// highly annoying, but the only way to get it stable right now
990	op = freed.back (); freed.pop_back ();
991	op->~object ();
992	new ((void *)op) object;
993	}
994
995	op->link ();	1017	op->link ();
996	return op;	1018	return op;
997	}	1019	}
998		1020
999	/*	1021	static struct freed_map : maptile
1000	* free_object() frees everything allocated by an object, removes
1001	* it from the list of used objects, and puts it on the list of
1002	* free objects. The IS_FREED() flag is set in the object.
1003	* The object must have been removed by remove_ob() first for
1004	* this function to succeed.
1005	*
1006	* If free_inventory is set, free inventory as well. Else drop items in
1007	* inventory to the ground.
1008	*/
1009	void object::free (bool free_inventory)
1010	{	1022	{
1011	if (!QUERY_FLAG (this, FLAG_REMOVED))	1023	freed_map ()
1012	{	1024	{
1013	LOG (llevDebug, "Free object called with non removed object\n");	1025	path = "<freed objects map>";
1014	dump_object (this);	1026	name = "/internal/freed_objects_map";
1015	#ifdef MANY_CORES	1027	width = 3;
1016	abort ();	1028	height = 3;
1017	#endif	1029	no_drop = 1;
		1030	no_reset = 1;
		1031
		1032	alloc ();
		1033	in_memory = MAP_ACTIVE;
1018	}	1034	}
1019		1035
1020	if (QUERY_FLAG (this, FLAG_FRIENDLY))	1036	~freed_map ()
1021	{	1037	{
1022	LOG (llevMonster, "Warning: tried to free friendly object.\n");	1038	destroy ();
		1039	}
		1040	} freed_map; // freed objects are moved here to avoid crashes
		1041
		1042	void
		1043	object::do_destroy ()
		1044	{
		1045	if (flag [FLAG_IS_LINKED])
		1046	remove_link ();
		1047
		1048	if (flag [FLAG_FRIENDLY])
1023	remove_friendly_object (this);	1049	remove_friendly_object (this);
		1050
		1051	remove ();
		1052
		1053	attachable::do_destroy ();
		1054
		1055	deactivate ();
		1056	unlink ();
		1057
		1058	flag [FLAG_FREED] = 1;
		1059
		1060	// hack to ensure that freed objects still have a valid map
		1061	map = &freed_map;
		1062	x = 1;
		1063	y = 1;
		1064
		1065	if (more)
1024	}	1066	{
1025		1067	more->destroy ();
1026	if (QUERY_FLAG (this, FLAG_FREED))	1068	more = 0;
1027	{	1069	}
1028	dump_object (this);	1070
1029	LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);	1071	head = 0;
		1072
		1073	// clear those pointers that likely might cause circular references
		1074	owner = 0;
		1075	enemy = 0;
		1076	attacked_by = 0;
		1077	current_weapon = 0;
		1078	}
		1079
		1080	void
		1081	object::destroy ()
		1082	{
		1083	if (destroyed ())
		1084	return;
		1085
		1086	if (!is_head () && !head->destroyed ())
		1087	{
		1088	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1089	head->destroy ();
1030	return;	1090	return;
1031	}	1091	}
1032		1092
1033	if (more)	1093	destroy_inv (false);
1034	{
1035	more->free (free_inventory);
1036	more = 0;
1037	}
1038		1094
1039	if (inv)	1095	if (is_head ())
1040	{	1096	if (sound_destroy)
1041	/* Only if the space blocks everything do we not process -	1097	play_sound (sound_destroy);
1042	* if some form of movement is allowed, let objects	1098	else if (flag [FLAG_MONSTER])
1043	* drop on that space.	1099	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
1044	*/
1045	if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))
1046	{
1047	object *
1048	op = inv;
1049		1100
1050	while (op)	1101	attachable::destroy ();
1051	{
1052	object *
1053	tmp = op->below;
1054
1055	remove_ob (op);
1056	op->free (free_inventory);
1057	op = tmp;
1058	}
1059	}
1060	else
1061	{ /* Put objects in inventory onto this space */
1062	object *
1063	op = inv;
1064
1065	while (op)
1066	{
1067	object *
1068	tmp = op->below;
1069
1070	remove_ob (op);
1071
1072	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1073	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
1074	free_object (op);
1075	else
1076	{
1077	op->x = x;
1078	op->y = y;
1079	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
1080	}
1081
1082	op = tmp;
1083	}
1084	}
1085	}
1086
1087	clear_owner (this);
1088
1089	/* Remove object from the active list */
1090	speed = 0;
1091	update_ob_speed (this);
1092
1093	unlink ();
1094
1095	SET_FLAG (this, FLAG_FREED);
1096
1097	mortals.push_back (this);
1098	}	1102	}
1099		1103
1100	/*	1104	/* op->remove ():
1101	* sub_weight() recursively (outwards) subtracts a number from the
1102	* weight of an object (and what is carried by it's environment(s)).
1103	*/
1104
1105	void
1106	sub_weight (object *op, signed long weight)
1107	{
1108	while (op != NULL)
1109	{
1110	if (op->type == CONTAINER)
1111	{
1112	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1113	}
1114	op->carrying -= weight;
1115	op = op->env;
1116	}
1117	}
1118
1119	/* remove_ob(op):
1120	* This function removes the object op from the linked list of objects	1105	* This function removes the object op from the linked list of objects
1121	* which it is currently tied to. When this function is done, the	1106	* which it is currently tied to. When this function is done, the
1122	* object will have no environment. If the object previously had an	1107	* object will have no environment. If the object previously had an
1123	* environment, the x and y coordinates will be updated to	1108	* environment, the x and y coordinates will be updated to
1124	* the previous environment.	1109	* the previous environment.
1125	* Beware: This function is called from the editor as well!
1126	*/	1110	*/
1127
1128	void	1111	void
1129	remove_ob (object *op)	1112	object::do_remove ()
1130	{	1113	{
1131	object *tmp, *last = NULL;	1114	if (flag [FLAG_REMOVED])
1132	object *otmp;	1115	return;
1133		1116
1134	tag_t tag;	1117	INVOKE_OBJECT (REMOVE, this);
1135	int check_walk_off;
1136	mapstruct *m;
1137		1118
1138	sint16 x, y;	1119	flag [FLAG_REMOVED] = true;
1139		1120
1140	if (QUERY_FLAG (op, FLAG_REMOVED))	1121	if (more)
1141	{	1122	more->remove ();
1142	dump_object (op);
1143	LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg);
1144
1145	/* Changed it to always dump core in this case. As has been learned
1146	* in the past, trying to recover from errors almost always
1147	* make things worse, and this is a real error here - something
1148	* that should not happen.
1149	* Yes, if this was a mission critical app, trying to do something
1150	* to recover may make sense, but that is because failure of the app
1151	* may have other disastrous problems. Cf runs out of a script
1152	* so is easily enough restarted without any real problems.
1153	* MSW 2001-07-01
1154	*/
1155	abort ();
1156	}
1157
1158	if (op->more != NULL)
1159	remove_ob (op->more);
1160
1161	SET_FLAG (op, FLAG_REMOVED);
1162		1123
1163	/*	1124	/*
1164	* In this case, the object to be removed is in someones	1125	* In this case, the object to be removed is in someones
1165	* inventory.	1126	* inventory.
1166	*/	1127	*/
1167	if (op->env != NULL)	1128	if (env)
1168	{	1129	{
1169	if (op->nrof)	1130	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1170	sub_weight (op->env, op->weight * op->nrof);	1131	if (object *pl = visible_to ())
1171	else	1132	esrv_del_item (pl->contr, count);
1172	sub_weight (op->env, op->weight + op->carrying);	1133	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1173		1134
1174	/* NO_FIX_PLAYER is set when a great many changes are being	1135	adjust_weight (env, -total_weight ());
1175	* made to players inventory. If set, avoiding the call
1176	* to save cpu time.
1177	*/
1178	if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1179	fix_player (otmp);
1180		1136
1181	if (op->above != NULL)	1137	object *pl = in_player ();
1182	op->above->below = op->below;
1183	else
1184	op->env->inv = op->below;
1185
1186	if (op->below != NULL)
1187	op->below->above = op->above;
1188		1138
1189	/* we set up values so that it could be inserted into	1139	/* we set up values so that it could be inserted into
1190	* the map, but we don't actually do that - it is up	1140	* the map, but we don't actually do that - it is up
1191	* to the caller to decide what we want to do.	1141	* to the caller to decide what we want to do.
1192	*/	1142	*/
1193	op->x = op->env->x, op->y = op->env->y;
1194	op->map = op->env->map;	1143	map = env->map;
1195	op->above = NULL, op->below = NULL;	1144	x = env->x;
1196	op->env = NULL;	1145	y = env->y;
1197	return;
1198	}
1199		1146
1200	/* If we get here, we are removing it from a map */	1147	// make sure cmov optimisation is applicable
1201	if (op->map == NULL)	1148	*(above ? &above->below : &env->inv) = below;
1202	return;	1149	*(below ? &below->above : &above ) = above; // &above is just a dummy
1203		1150
1204	x = op->x;	1151	above = 0;
1205	y = op->y;	1152	below = 0;
1206	m = get_map_from_coord (op->map, &x, &y);	1153	env = 0;
1207		1154
1208	if (!m)	1155	if (pl && pl->is_player ())
1209	{
1210	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1211	op->map->path, op->x, op->y);
1212	/* in old days, we used to set x and y to 0 and continue.
1213	* it seems if we get into this case, something is probablye
1214	* screwed up and should be fixed.
1215	*/
1216	abort ();
1217	}
1218	if (op->map != m)
1219	{
1220	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1221	op->map->path, m->path, op->x, op->y, x, y);
1222	}
1223
1224	/* Re did the following section of code - it looks like it had
1225	* lots of logic for things we no longer care about
1226	*/
1227
1228	/* link the object above us */
1229	if (op->above)
1230	op->above->below = op->below;
1231	else
1232	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1233
1234	/* Relink the object below us, if there is one */
1235	if (op->below)
1236	op->below->above = op->above;
1237	else
1238	{
1239	/* Nothing below, which means we need to relink map object for this space
1240	* use translated coordinates in case some oddness with map tiling is
1241	* evident
1242	*/
1243	if (GET_MAP_OB (m, x, y) != op)
1244	{	1156	{
1245	dump_object (op);	1157	pl->contr->queue_stats_update ();
1246	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n",	1158
1247	errmsg);	1159	if (glow_radius && pl->is_on_map ())
1248	dump_object (GET_MAP_OB (m, x, y));	1160	update_all_los (pl->map, pl->x, pl->y);
1249	LOG (llevError, "%s\n", errmsg);
1250	}	1161	}
1251
1252	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1253	}
1254
1255	op->above = NULL;
1256	op->below = NULL;
1257
1258	if (op->map->in_memory == MAP_SAVING)
1259	return;
1260
1261	tag = op->count;
1262	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1263
1264	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1265	{	1162	}
1266	/* No point updating the players look faces if he is the object	1163	else if (map)
1267	* being removed.	1164	{
1268	*/	1165	map->dirty = true;
		1166	mapspace &ms = this->ms ();
1269		1167
1270	if (tmp->type == PLAYER && tmp != op)	1168	if (object *pl = ms.player ())
1271	{	1169	{
1272	/* If a container that the player is currently using somehow gets	1170	if (is_player ())
1273	* removed (most likely destroyed), update the player view
1274	* appropriately.
1275	*/
1276	if (tmp->container == op)
1277	{	1171	{
1278	CLEAR_FLAG (op, FLAG_APPLIED);	1172	if (!flag [FLAG_WIZPASS])
1279	tmp->container = NULL;	1173	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1174
		1175	// leaving a spot always closes any open container on the ground
		1176	if (container && !container->env)
		1177	// this causes spurious floorbox updates, but it ensures
		1178	// that the CLOSE event is being sent.
		1179	close_container ();
		1180
		1181	--map->players;
		1182	map->touch ();
1280	}	1183	}
		1184	else if (pl->container_ () == this)
		1185	{
		1186	// removing a container should close it
		1187	close_container ();
		1188	}
1281		1189
1282	tmp->contr->socket.update_look = 1;	1190	esrv_del_item (pl->contr, count);
1283	}	1191	}
1284	/* See if player moving off should effect something */	1192
1285	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1193	/* link the object above us */
		1194	// re-link, make sure compiler can easily use cmove
		1195	*(above ? &above->below : &ms.top) = below;
		1196	*(below ? &below->above : &ms.bot) = above;
		1197
		1198	above = 0;
		1199	below = 0;
		1200
		1201	ms.invalidate ();
		1202
		1203	if (map->in_memory == MAP_SAVING)
		1204	return;
		1205
		1206	int check_walk_off = !flag [FLAG_NO_APPLY];
		1207
		1208	if (object *pl = ms.player ())
1286	{	1209	{
1287	move_apply (tmp, op, NULL);	1210	if (pl->container_ () == this)
1288		1211	/* If a container that the player is currently using somehow gets
1289	if (was_destroyed (op, tag))	1212	* removed (most likely destroyed), update the player view
		1213	* appropriately.
1290	{	1214	*/
1291	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);	1215	pl->close_container ();
1292	}	1216
		1217	//TODO: the floorbox prev/next might need updating
		1218	//esrv_del_item (pl->contr, count);
		1219	//TODO: update floorbox to preserve ordering
		1220	if (pl->contr->ns)
		1221	pl->contr->ns->floorbox_update ();
1293	}	1222	}
1294		1223
1295	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1224	if (check_walk_off)
		1225	for (object *above, *tmp = ms.bot; tmp; tmp = above)
		1226	{
		1227	above = tmp->above;
1296		1228
1297	if (tmp->above == tmp)	1229	/* No point updating the players look faces if he is the object
1298	tmp->above = NULL;	1230	* being removed.
		1231	*/
1299		1232
1300	last = tmp;	1233	/* See if object moving off should effect something */
1301	}	1234	if ((move_type & tmp->move_off)
		1235	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
		1236	move_apply (tmp, this, 0);
		1237	}
1302		1238
1303	/* last == NULL of there are no objects on this space */	1239	if (affects_los ())
1304	if (last == NULL)	1240	update_all_los (map, x, y);
1305	{	1241	}
1306	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1307	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1308	* those out anyways, and if there are any flags set right now, they won't
1309	* be correct anyways.
1310	*/
1311	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1312	update_position (op->map, op->x, op->y);
1313	}
1314	else
1315	update_object (last, UP_OBJ_REMOVE);
1316
1317	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1318	update_all_los (op->map, op->x, op->y);
1319	}	1242	}
1320		1243
1321	/*	1244	/*
1322	* merge_ob(op,top):	1245	* merge_ob(op,top):
1323	*	1246	*
1324	* This function goes through all objects below and including top, and	1247	* This function goes through all objects below and including top, and
1325	* merges op to the first matching object.	1248	* merges op to the first matching object.
1326	* If top is NULL, it is calculated.	1249	* If top is NULL, it is calculated.
1327	* Returns pointer to object if it succeded in the merge, otherwise NULL	1250	* Returns pointer to object if it succeded in the merge, otherwise NULL
1328	*/	1251	*/
1329
1330	object *	1252	object *
1331	merge_ob (object *op, object *top)	1253	merge_ob (object *op, object *top)
1332	{	1254	{
1333	if (!op->nrof)	1255	if (!op->nrof)
1334	return 0;	1256	return 0;
1335	if (top == NULL)	1257
		1258	if (!top)
1336	for (top = op; top != NULL && top->above != NULL; top = top->above);	1259	for (top = op; top && top->above; top = top->above)
		1260	;
		1261
1337	for (; top != NULL; top = top->below)	1262	for (; top; top = top->below)
1338	{	1263	if (object::can_merge (op, top))
1339	if (top == op)
1340	continue;
1341	if (CAN_MERGE (op, top))
1342	{	1264	{
1343	top->nrof += op->nrof;	1265	top->nrof += op->nrof;
1344		1266
1345	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1267	if (object *pl = top->visible_to ())
1346	op->weight = 0; /* Don't want any adjustements now */	1268	esrv_update_item (UPD_NROF, pl, top);
1347	remove_ob (op);	1269
1348	free_object (op);	1270	op->weight = 0; // cancel the addition above
		1271	op->carrying = 0; // must be 0 already
		1272
		1273	op->destroy ();
		1274
1349	return top;	1275	return top;
1350	}	1276	}
1351	}	1277
1352	return NULL;	1278	return 0;
1353	}	1279	}
1354		1280
		1281	void
		1282	object::expand_tail ()
		1283	{
		1284	if (more)
		1285	return;
		1286
		1287	object *prev = this;
		1288
		1289	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1290	{
		1291	object *op = at->instance ();
		1292
		1293	op->name = name;
		1294	op->name_pl = name_pl;
		1295	op->title = title;
		1296
		1297	op->head = this;
		1298	prev->more = op;
		1299
		1300	prev = op;
		1301	}
		1302	}
		1303
1355	/*	1304	/*
1356	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1305	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1357	* job preparing multi-part monsters	1306	* job preparing multi-part monsters.
1358	*/	1307	*/
1359	object *	1308	object *
1360	insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)	1309	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1361	{	1310	{
1362	object *	1311	op->remove ();
1363	tmp;
1364		1312
1365	if (op->head)
1366	op = op->head;
1367	for (tmp = op; tmp; tmp = tmp->more)	1313	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1368	{	1314	{
1369	tmp->x = x + tmp->arch->clone.x;	1315	tmp->x = x + tmp->arch->x;
1370	tmp->y = y + tmp->arch->clone.y;	1316	tmp->y = y + tmp->arch->y;
1371	}	1317	}
		1318
1372	return insert_ob_in_map (op, m, originator, flag);	1319	return insert_ob_in_map (op, m, originator, flag);
1373	}	1320	}
1374		1321
1375	/*	1322	/*
1376	* insert_ob_in_map (op, map, originator, flag):	1323	* insert_ob_in_map (op, map, originator, flag):
…		…
1387	* Passing 0 for flag gives proper default values, so flag really only needs	1334	* Passing 0 for flag gives proper default values, so flag really only needs
1388	* to be set if special handling is needed.	1335	* to be set if special handling is needed.
1389	*	1336	*
1390	* Return value:	1337	* Return value:
1391	* new object if 'op' was merged with other object	1338	* new object if 'op' was merged with other object
1392	* NULL if 'op' was destroyed	1339	* NULL if there was an error (destroyed, blocked etc.)
1393	* just 'op' otherwise	1340	* just 'op' otherwise
1394	*/	1341	*/
1395
1396	object *	1342	object *
1397	insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)	1343	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1398	{	1344	{
1399	object *tmp, *top, *floor = NULL;	1345	op->remove ();
1400	sint16 x, y;
1401		1346
1402	if (QUERY_FLAG (op, FLAG_FREED))	1347	if (m == &freed_map)//D TODO: remove soon
1403	{	1348	{//D
1404	LOG (llevError, "Trying to insert freed object!\n");	1349	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1405	return NULL;
1406	}	1350	}//D
1407
1408	if (m == NULL)
1409	{
1410	dump_object (op);
1411	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);
1412	return op;
1413	}
1414
1415	if (out_of_map (m, op->x, op->y))
1416	{
1417	dump_object (op);
1418	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);
1419	#ifdef MANY_CORES
1420	/* Better to catch this here, as otherwise the next use of this object
1421	* is likely to cause a crash. Better to find out where it is getting
1422	* improperly inserted.
1423	*/
1424	abort ();
1425	#endif
1426	return op;
1427	}
1428
1429	if (!QUERY_FLAG (op, FLAG_REMOVED))
1430	{
1431	dump_object (op);
1432	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);
1433	return op;
1434	}
1435
1436	if (op->more != NULL)
1437	{
1438	/* The part may be on a different map. */
1439
1440	object *more = op->more;
1441
1442	/* We really need the caller to normalize coordinates - if
1443	* we set the map, that doesn't work if the location is within
1444	* a map and this is straddling an edge. So only if coordinate
1445	* is clear wrong do we normalize it.
1446	*/
1447	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1448	more->map = get_map_from_coord (m, &more->x, &more->y);
1449	else if (!more->map)
1450	{
1451	/* For backwards compatibility - when not dealing with tiled maps,
1452	* more->map should always point to the parent.
1453	*/
1454	more->map = m;
1455	}
1456
1457	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1458	{
1459	if (!op->head)
1460	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1461
1462	return NULL;
1463	}
1464	}
1465
1466	CLEAR_FLAG (op, FLAG_REMOVED);
1467		1351
1468	/* Ideally, the caller figures this out. However, it complicates a lot	1352	/* Ideally, the caller figures this out. However, it complicates a lot
1469	* of areas of callers (eg, anything that uses find_free_spot would now	1353	* of areas of callers (eg, anything that uses find_free_spot would now
1470	* need extra work	1354	* need extra work
1471	*/	1355	*/
1472	op->map = get_map_from_coord (m, &op->x, &op->y);	1356	maptile *newmap = m;
1473	x = op->x;	1357	if (!xy_normalise (newmap, op->x, op->y))
1474	y = op->y;	1358	{
		1359	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
		1360	return 0;
		1361	}
		1362
		1363	if (object *more = op->more)
		1364	if (!insert_ob_in_map (more, m, originator, flag))
		1365	return 0;
		1366
		1367	op->flag [FLAG_REMOVED] = false;
		1368	op->env = 0;
		1369	op->map = newmap;
		1370
		1371	mapspace &ms = op->ms ();
1475		1372
1476	/* this has to be done after we translate the coordinates.	1373	/* this has to be done after we translate the coordinates.
1477	*/	1374	*/
1478	if (op->nrof && !(flag & INS_NO_MERGE))	1375	if (op->nrof && !(flag & INS_NO_MERGE))
1479	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1376	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1480	if (CAN_MERGE (op, tmp))	1377	if (object::can_merge (op, tmp))
1481	{	1378	{
		1379	// TODO: we actually want to update tmp, not op,
		1380	// but some caller surely breaks when we return tmp
		1381	// from here :/
1482	op->nrof += tmp->nrof;	1382	op->nrof += tmp->nrof;
1483	remove_ob (tmp);	1383	tmp->destroy ();
1484	free_object (tmp);
1485	}	1384	}
1486		1385
1487	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1386	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1488	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1387	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1489		1388
…		…
1496	{	1395	{
1497	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1396	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1498	abort ();	1397	abort ();
1499	}	1398	}
1500		1399
		1400	if (!originator->is_on_map ())
		1401	{
		1402	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1403	op->debug_desc (), originator->debug_desc ());
		1404	abort ();
		1405	}
		1406
1501	op->above = originator;	1407	op->above = originator;
1502	op->below = originator->below;	1408	op->below = originator->below;
1503
1504	if (op->below)
1505	op->below->above = op;
1506	else
1507	SET_MAP_OB (op->map, op->x, op->y, op);
1508
1509	/* since *below* originator, no need to update top */
1510	originator->below = op;	1409	originator->below = op;
		1410
		1411	*(op->below ? &op->below->above : &ms.bot) = op;
1511	}	1412	}
1512	else	1413	else
1513	{	1414	{
		1415	object *floor = 0;
		1416	object *top = ms.top;
		1417
1514	/* If there are other objects, then */	1418	/* If there are other objects, then */
1515	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1419	if (top)
1516	{	1420	{
1517	object *last = NULL;
1518
1519	/*	1421	/*
1520	* If there are multiple objects on this space, we do some trickier handling.	1422	* If there are multiple objects on this space, we do some trickier handling.
1521	* We've already dealt with merging if appropriate.	1423	* We've already dealt with merging if appropriate.
1522	* Generally, we want to put the new object on top. But if	1424	* Generally, we want to put the new object on top. But if
1523	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1425	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1526	* once we get to them. This reduces the need to traverse over all of	1428	* once we get to them. This reduces the need to traverse over all of
1527	* them when adding another one - this saves quite a bit of cpu time	1429	* them when adding another one - this saves quite a bit of cpu time
1528	* when lots of spells are cast in one area. Currently, it is presumed	1430	* when lots of spells are cast in one area. Currently, it is presumed
1529	* that flying non pickable objects are spell objects.	1431	* that flying non pickable objects are spell objects.
1530	*/	1432	*/
1531		1433	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1532	while (top != NULL)
1533	{	1434	{
1534	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1435	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1535	floor = top;	1436	floor = tmp;
1536		1437
1537	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1438	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1538	{	1439	{
1539	/* We insert above top, so we want this object below this */	1440	/* We insert above top, so we want this object below this */
1540	top = top->below;	1441	top = tmp->below;
1541	break;	1442	break;
1542	}	1443	}
1543		1444
1544	last = top;
1545	top = top->above;	1445	top = tmp;
1546	}	1446	}
1547
1548	/* Don't want top to be NULL, so set it to the last valid object */
1549	top = last;
1550		1447
1551	/* We let update_position deal with figuring out what the space	1448	/* We let update_position deal with figuring out what the space
1552	* looks like instead of lots of conditions here.	1449	* looks like instead of lots of conditions here.
1553	* makes things faster, and effectively the same result.	1450	* makes things faster, and effectively the same result.
1554	*/	1451	*/
1555		1452
1556	/* Have object 'fall below' other objects that block view.	1453	/* Have object 'fall below' other objects that block view.
1557	* Unless those objects are exits, type 66	1454	* Unless those objects are exits.
1558	* If INS_ON_TOP is used, don't do this processing	1455	* If INS_ON_TOP is used, don't do this processing
1559	* Need to find the object that in fact blocks view, otherwise	1456	* Need to find the object that in fact blocks view, otherwise
1560	* stacking is a bit odd.	1457	* stacking is a bit odd.
1561	*/	1458	*/
1562	if (!(flag & INS_ON_TOP) &&	1459	if (!(flag & INS_ON_TOP)
1563	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1460	&& ms.flags () & P_BLOCKSVIEW
		1461	&& (op->face && !faces [op->face].visibility))
1564	{	1462	{
		1463	object *last;
		1464
1565	for (last = top; last != floor; last = last->below)	1465	for (last = top; last != floor; last = last->below)
1566	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1466	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1567	break;	1467	break;
		1468
1568	/* Check to see if we found the object that blocks view,	1469	/* Check to see if we found the object that blocks view,
1569	* and make sure we have a below pointer for it so that	1470	* and make sure we have a below pointer for it so that
1570	* we can get inserted below this one, which requires we	1471	* we can get inserted below this one, which requires we
1571	* set top to the object below us.	1472	* set top to the object below us.
1572	*/	1473	*/
1573	if (last && last->below && last != floor)	1474	if (last && last->below && last != floor)
1574	top = last->below;	1475	top = last->below;
1575	}	1476	}
1576	} /* If objects on this space */	1477	} /* If objects on this space */
1577		1478
1578	if (flag & INS_MAP_LOAD)
1579	top = GET_MAP_TOP (op->map, op->x, op->y);
1580
1581	if (flag & INS_ABOVE_FLOOR_ONLY)	1479	if (flag & INS_ABOVE_FLOOR_ONLY)
1582	top = floor;	1480	top = floor;
1583		1481
1584	/* Top is the object that our object (op) is going to get inserted above.	1482	// insert object above top, or bottom-most if top = 0
1585	*/
1586
1587	/* First object on this space */
1588	if (!top)	1483	if (!top)
1589	{	1484	{
1590	op->above = GET_MAP_OB (op->map, op->x, op->y);
1591
1592	if (op->above)
1593	op->above->below = op;
1594
1595	op->below = NULL;	1485	op->below = 0;
1596	SET_MAP_OB (op->map, op->x, op->y, op);	1486	op->above = ms.bot;
		1487	ms.bot = op;
		1488
		1489	*(op->above ? &op->above->below : &ms.top) = op;
1597	}	1490	}
1598	else	1491	else
1599	{ /* get inserted into the stack above top */	1492	{
1600	op->above = top->above;	1493	op->above = top->above;
1601
1602	if (op->above)
1603	op->above->below = op;	1494	top->above = op;
1604		1495
1605	op->below = top;	1496	op->below = top;
1606	top->above = op;	1497	*(op->above ? &op->above->below : &ms.top) = op;
1607	}	1498	}
		1499	}
1608		1500
1609	if (op->above == NULL)	1501	if (op->is_player ())
1610	SET_MAP_TOP (op->map, op->x, op->y, op);	1502	{
1611	} /* else not INS_BELOW_ORIGINATOR */
1612
1613	if (op->type == PLAYER)
1614	op->contr->do_los = 1;	1503	op->contr->do_los = 1;
		1504	++op->map->players;
		1505	op->map->touch ();
		1506	}
1615		1507
1616	/* If we have a floor, we know the player, if any, will be above	1508	op->map->dirty = true;
1617	* it, so save a few ticks and start from there.	1509
1618	*/	1510	if (object *pl = ms.player ())
1619	if (!(flag & INS_MAP_LOAD))	1511	//TODO: the floorbox prev/next might need updating
1620	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1512	//esrv_send_item (pl, op);
1621	if (tmp->type == PLAYER)	1513	//TODO: update floorbox to preserve ordering
1622	tmp->contr->socket.update_look = 1;	1514	if (pl->contr->ns)
		1515	pl->contr->ns->floorbox_update ();
1623		1516
1624	/* If this object glows, it may affect lighting conditions that are	1517	/* If this object glows, it may affect lighting conditions that are
1625	* visible to others on this map. But update_all_los is really	1518	* visible to others on this map. But update_all_los is really
1626	* an inefficient way to do this, as it means los for all players	1519	* an inefficient way to do this, as it means los for all players
1627	* on the map will get recalculated. The players could very well	1520	* on the map will get recalculated. The players could very well
1628	* be far away from this change and not affected in any way -	1521	* be far away from this change and not affected in any way -
1629	* this should get redone to only look for players within range,	1522	* this should get redone to only look for players within range,
1630	* or just updating the P_NEED_UPDATE for spaces within this area	1523	* or just updating the P_UPTODATE for spaces within this area
1631	* of effect may be sufficient.	1524	* of effect may be sufficient.
1632	*/	1525	*/
1633	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1526	if (op->affects_los ())
		1527	{
		1528	op->ms ().invalidate ();
1634	update_all_los (op->map, op->x, op->y);	1529	update_all_los (op->map, op->x, op->y);
		1530	}
1635		1531
1636	/* updates flags (blocked, alive, no magic, etc) for this map space */	1532	/* updates flags (blocked, alive, no magic, etc) for this map space */
1637	update_object (op, UP_OBJ_INSERT);	1533	update_object (op, UP_OBJ_INSERT);
1638		1534
		1535	INVOKE_OBJECT (INSERT, op);
		1536
1639	/* Don't know if moving this to the end will break anything. However,	1537	/* Don't know if moving this to the end will break anything. However,
1640	* we want to have update_look set above before calling this.	1538	* we want to have floorbox_update called before calling this.
1641	*	1539	*
1642	* check_move_on() must be after this because code called from	1540	* check_move_on() must be after this because code called from
1643	* check_move_on() depends on correct map flags (so functions like	1541	* check_move_on() depends on correct map flags (so functions like
1644	* blocked() and wall() work properly), and these flags are updated by	1542	* blocked() and wall() work properly), and these flags are updated by
1645	* update_object().	1543	* update_object().
1646	*/	1544	*/
1647		1545
1648	/* if this is not the head or flag has been passed, don't check walk on status */	1546	/* if this is not the head or flag has been passed, don't check walk on status */
1649	if (!(flag & INS_NO_WALK_ON) && !op->head)	1547	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1650	{	1548	{
1651	if (check_move_on (op, originator))	1549	if (check_move_on (op, originator))
1652	return NULL;	1550	return 0;
1653		1551
1654	/* If we are a multi part object, lets work our way through the check	1552	/* If we are a multi part object, lets work our way through the check
1655	* walk on's.	1553	* walk on's.
1656	*/	1554	*/
1657	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1555	for (object *tmp = op->more; tmp; tmp = tmp->more)
1658	if (check_move_on (tmp, originator))	1556	if (check_move_on (tmp, originator))
1659	return NULL;	1557	return 0;
1660	}	1558	}
1661		1559
1662	return op;	1560	return op;
1663	}	1561	}
1664		1562
1665	/* this function inserts an object in the map, but if it	1563	/* this function inserts an object in the map, but if it
1666	* finds an object of its own type, it'll remove that one first.	1564	* finds an object of its own type, it'll remove that one first.
1667	* op is the object to insert it under: supplies x and the map.	1565	* op is the object to insert it under: supplies x and the map.
1668	*/	1566	*/
1669	void	1567	void
1670	replace_insert_ob_in_map (const char *arch_string, object *op)	1568	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1671	{	1569	{
1672	object *tmp;
1673	object *tmp1;
1674
1675	/* first search for itself and remove any old instances */	1570	/* first search for itself and remove any old instances */
1676		1571
1677	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1572	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1678	{
1679	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1573	if (tmp->arch->archname == archname) /* same archetype */
1680	{	1574	tmp->destroy ();
1681	remove_ob (tmp);
1682	free_object (tmp);
1683	}
1684	}
1685		1575
1686	tmp1 = arch_to_object (find_archetype (arch_string));	1576	object *tmp = archetype::find (archname)->instance ();
1687		1577
1688	tmp1->x = op->x;	1578	tmp->x = op->x;
1689	tmp1->y = op->y;	1579	tmp->y = op->y;
		1580
1690	insert_ob_in_map (tmp1, op->map, op, 0);	1581	insert_ob_in_map (tmp, op->map, op, 0);
1691	}	1582	}
1692
1693	/*
1694	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1695	* is returned contains nr objects, and the remaining parts contains
1696	* the rest (or is removed and freed if that number is 0).
1697	* On failure, NULL is returned, and the reason put into the
1698	* global static errmsg array.
1699	*/
1700		1583
1701	object *	1584	object *
1702	get_split_ob (object *orig_ob, uint32 nr)	1585	object::insert_at (object *where, object *originator, int flags)
1703	{	1586	{
1704	object *	1587	if (where->env)
1705	newob;	1588	return where->env->insert (this);
1706	int	1589	else
1707	is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1590	return where->map->insert (this, where->x, where->y, originator, flags);
1708
1709	if (orig_ob->nrof < nr)
1710	{
1711	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1712	return NULL;
1713	}
1714	newob = object_create_clone (orig_ob);
1715	if ((orig_ob->nrof -= nr) < 1)
1716	{
1717	if (!is_removed)
1718	remove_ob (orig_ob);
1719	free_object2 (orig_ob, 1);
1720	}
1721	else if (!is_removed)
1722	{
1723	if (orig_ob->env != NULL)
1724	sub_weight (orig_ob->env, orig_ob->weight * nr);
1725	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1726	{
1727	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1728	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1729	return NULL;
1730	}
1731	}
1732	newob->nrof = nr;
1733
1734	return newob;
1735	}	1591	}
1736		1592
		1593	// check whether we can put this into the map, respect max_volume, max_items
		1594	bool
		1595	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1596	{
		1597	mapspace &ms = m->at (x, y);
		1598
		1599	int items = ms.items ();
		1600
		1601	if (!items // testing !items ensures we can drop at least one item
		1602	|| (items < m->max_items
		1603	&& ms.volume () < m->max_volume))
		1604	return true;
		1605
		1606	if (originator && originator->is_player ())
		1607	originator->contr->failmsg (format (
		1608	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1609	query_name ()
		1610	));
		1611
		1612	return false;
		1613	}
		1614
1737	/*	1615	/*
1738	* decrease_ob_nr(object, number) decreases a specified number from	1616	* decrease(object, number) decreases a specified number from
1739	* the amount of an object. If the amount reaches 0, the object	1617	* the amount of an object. If the amount reaches 0, the object
1740	* is subsequently removed and freed.	1618	* is subsequently removed and freed.
1741	*	1619	*
1742	* Return value: 'op' if something is left, NULL if the amount reached 0	1620	* Return value: 'op' if something is left, NULL if the amount reached 0
1743	*/	1621	*/
		1622	bool
		1623	object::decrease (sint32 nr)
		1624	{
		1625	if (!nr)
		1626	return true;
1744		1627
		1628	nr = min (nr, nrof);
		1629
		1630	if (nrof > nr)
		1631	{
		1632	nrof -= nr;
		1633	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
		1634
		1635	if (object *pl = visible_to ())
		1636	esrv_update_item (UPD_NROF, pl, this);
		1637
		1638	return true;
		1639	}
		1640	else
		1641	{
		1642	destroy ();
		1643	return false;
		1644	}
		1645	}
		1646
		1647	/*
		1648	* split(ob,nr) splits up ob into two parts. The part which
		1649	* is returned contains nr objects, and the remaining parts contains
		1650	* the rest (or is removed and returned if that number is 0).
		1651	* On failure, NULL is returned.
		1652	*/
1745	object *	1653	object *
1746	decrease_ob_nr (object *op, uint32 i)	1654	object::split (sint32 nr)
1747	{	1655	{
1748	object *	1656	int have = number_of ();
1749	tmp;
1750	player *
1751	pl;
1752		1657
1753	if (i == 0) /* objects with op->nrof require this check */	1658	if (have < nr)
1754	return op;	1659	return 0;
1755		1660	else if (have == nr)
1756	if (i > op->nrof)
1757	i = op->nrof;
1758
1759	if (QUERY_FLAG (op, FLAG_REMOVED))
1760	{
1761	op->nrof -= i;
1762	}	1661	{
1763	else if (op->env != NULL)
1764	{
1765	/* is this object in the players inventory, or sub container
1766	* therein?
1767	*/
1768	tmp = is_player_inv (op->env);
1769	/* nope. Is this a container the player has opened?
1770	* If so, set tmp to that player.
1771	* IMO, searching through all the players will mostly
1772	* likely be quicker than following op->env to the map,
1773	* and then searching the map for a player.
1774	*/
1775	if (!tmp)
1776	{
1777	for (pl = first_player; pl; pl = pl->next)
1778	if (pl->ob->container == op->env)
1779	break;
1780	if (pl)
1781	tmp = pl->ob;
1782	else
1783	tmp = NULL;
1784	}
1785
1786	if (i < op->nrof)
1787	{
1788	sub_weight (op->env, op->weight * i);
1789	op->nrof -= i;
1790	if (tmp)
1791	{
1792	esrv_send_item (tmp, op);
1793	}
1794	}
1795	else
1796	{
1797	remove_ob (op);	1662	remove ();
1798	op->nrof = 0;	1663	return this;
1799	if (tmp)
1800	{
1801	esrv_del_item (tmp->contr, op->count);
1802	}
1803	}
1804	}	1664	}
1805	else	1665	else
1806	{	1666	{
1807	object *	1667	decrease (nr);
1808	above = op->above;
1809		1668
1810	if (i < op->nrof)	1669	object *op = deep_clone ();
1811	{
1812	op->nrof -= i;
1813	}
1814	else
1815	{
1816	remove_ob (op);
1817	op->nrof = 0;	1670	op->nrof = nr;
1818	}
1819	/* Since we just removed op, op->above is null */
1820	for (tmp = above; tmp != NULL; tmp = tmp->above)
1821	if (tmp->type == PLAYER)
1822	{
1823	if (op->nrof)
1824	esrv_send_item (tmp, op);
1825	else
1826	esrv_del_item (tmp->contr, op->count);
1827	}
1828	}
1829
1830	if (op->nrof)
1831	{
1832	return op;	1671	return op;
1833	}	1672	}
1834	else	1673	}
		1674
		1675	object *
		1676	insert_ob_in_ob (object *op, object *where)
		1677	{
		1678	if (!where)
1835	{	1679	{
1836	free_object (op);	1680	char *dump = dump_object (op);
		1681	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
		1682	free (dump);
1837	return NULL;	1683	return op;
1838	}
1839	}
1840
1841	/*
1842	* add_weight(object, weight) adds the specified weight to an object,
1843	* and also updates how much the environment(s) is/are carrying.
1844	*/
1845
1846	void
1847	add_weight (object *op, signed long weight)
1848	{
1849	while (op != NULL)
1850	{	1684	}
1851	if (op->type == CONTAINER)	1685
1852	{	1686	if (where->head_ () != where)
1853	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1854	}
1855	op->carrying += weight;
1856	op = op->env;
1857	}	1687	{
1858	}	1688	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
		1689	where = where->head;
		1690	}
1859		1691
		1692	return where->insert (op);
		1693	}
		1694
1860	/*	1695	/*
1861	* insert_ob_in_ob(op,environment):	1696	* env->insert (op)
1862	* This function inserts the object op in the linked list	1697	* This function inserts the object op in the linked list
1863	* inside the object environment.	1698	* inside the object environment.
1864	*	1699	*
1865	* Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1866	* the inventory at the last position or next to other objects of the same
1867	* type.
1868	* Frank: Now sorted by type, archetype and magic!
1869	*
1870	* The function returns now pointer to inserted item, and return value can	1700	* The function returns now pointer to inserted item, and return value can
1871	* be != op, if items are merged. -Tero	1701	* be != op, if items are merged. -Tero
1872	*/	1702	*/
1873
1874	object *	1703	object *
1875	insert_ob_in_ob (object *op, object *where)	1704	object::insert (object *op)
1876	{	1705	{
1877	object *
1878	tmp, *
1879	otmp;
1880
1881	if (!QUERY_FLAG (op, FLAG_REMOVED))
1882	{
1883	dump_object (op);
1884	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1885	return op;
1886	}
1887	if (where == NULL)
1888	{
1889	dump_object (op);
1890	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1891	return op;
1892	}
1893	if (where->head)
1894	{
1895	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1896	where = where->head;
1897	}
1898	if (op->more)	1706	if (op->more)
1899	{	1707	{
1900	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1708	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1901	return op;	1709	return op;
1902	}	1710	}
1903	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1711
1904	CLEAR_FLAG (op, FLAG_REMOVED);	1712	op->remove ();
		1713
		1714	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1715
1905	if (op->nrof)	1716	if (op->nrof)
1906	{
1907	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)	1717	for (object *tmp = inv; tmp; tmp = tmp->below)
1908	if (CAN_MERGE (tmp, op))	1718	if (object::can_merge (tmp, op))
1909	{	1719	{
1910	/* return the original object and remove inserted object	1720	/* return the original object and remove inserted object
1911	(client needs the original object) */	1721	(client needs the original object) */
1912	tmp->nrof += op->nrof;	1722	tmp->nrof += op->nrof;
1913	/* Weight handling gets pretty funky. Since we are adding to	1723
1914	* tmp->nrof, we need to increase the weight.	1724	if (object *pl = tmp->visible_to ())
1915	*/	1725	esrv_update_item (UPD_NROF, pl, tmp);
1916	add_weight (where, op->weight * op->nrof);	1726
1917	SET_FLAG (op, FLAG_REMOVED);	1727	adjust_weight (this, op->total_weight ());
1918	free_object (op); /* free the inserted object */	1728
		1729	op->destroy ();
1919	op = tmp;	1730	op = tmp;
1920	remove_ob (op); /* and fix old object's links */	1731	goto inserted;
1921	CLEAR_FLAG (op, FLAG_REMOVED);
1922	break;
1923	}	1732	}
1924		1733
1925	/* I assume combined objects have no inventory	1734	op->owner = 0; // it's his/hers now. period.
1926	* We add the weight - this object could have just been removed
1927	* (if it was possible to merge). calling remove_ob will subtract
1928	* the weight, so we need to add it in again, since we actually do
1929	* the linking below
1930	*/
1931	add_weight (where, op->weight * op->nrof);
1932	}
1933	else
1934	add_weight (where, (op->weight + op->carrying));
1935
1936	otmp = is_player_inv (where);
1937	if (otmp && otmp->contr != NULL)
1938	{
1939	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1940	fix_player (otmp);
1941	}
1942
1943	op->map = NULL;	1735	op->map = 0;
1944	op->env = where;	1736	op->x = 0;
		1737	op->y = 0;
		1738
1945	op->above = NULL;	1739	op->above = 0;
1946	op->below = NULL;	1740	op->below = inv;
1947	op->x = 0, op->y = 0;	1741	op->env = this;
1948		1742
		1743	if (inv)
		1744	inv->above = op;
		1745
		1746	inv = op;
		1747
		1748	op->flag [FLAG_REMOVED] = 0;
		1749
		1750	if (object *pl = op->visible_to ())
		1751	esrv_send_item (pl, op);
		1752
		1753	adjust_weight (this, op->total_weight ());
		1754
		1755	inserted:
1949	/* reset the light list and los of the players on the map */	1756	/* reset the light list and los of the players on the map */
1950	if ((op->glow_radius != 0) && where->map)	1757	if (op->glow_radius && is_on_map ())
1951	{
1952	#ifdef DEBUG_LIGHTS
1953	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1954	#endif /* DEBUG_LIGHTS */
1955	if (MAP_DARKNESS (where->map))
1956	update_all_los (where->map, where->x, where->y);
1957	}	1758	{
1958		1759	update_stats ();
1959	/* Client has no idea of ordering so lets not bother ordering it here.	1760	update_all_los (map, x, y);
1960	* It sure simplifies this function...
1961	*/
1962	if (where->inv == NULL)
1963	where->inv = op;
1964	else
1965	{	1761	}
1966	op->below = where->inv;	1762	else if (is_player ())
1967	op->below->above = op;	1763	// if this is a player's inventory, update stats
1968	where->inv = op;	1764	contr->queue_stats_update ();
1969	}	1765
		1766	INVOKE_OBJECT (INSERT, this);
		1767
1970	return op;	1768	return op;
1971	}	1769	}
1972		1770
1973	/*	1771	/*
1974	* Checks if any objects has a move_type that matches objects	1772	* Checks if any objects has a move_type that matches objects
…		…
1988	*	1786	*
1989	* MSW 2001-07-08: Check all objects on space, not just those below	1787	* MSW 2001-07-08: Check all objects on space, not just those below
1990	* object being inserted. insert_ob_in_map may not put new objects	1788	* object being inserted. insert_ob_in_map may not put new objects
1991	* on top.	1789	* on top.
1992	*/	1790	*/
1993
1994	int	1791	int
1995	check_move_on (object *op, object *originator)	1792	check_move_on (object *op, object *originator)
1996	{	1793	{
1997	object *tmp;
1998	tag_t tag;
1999	mapstruct *m = op->map;
2000	int x = op->x, y = op->y;
2001
2002	MoveType move_on, move_slow, move_block;
2003
2004	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1794	if (QUERY_FLAG (op, FLAG_NO_APPLY))
2005	return 0;	1795	return 0;
2006		1796
2007	tag = op->count;	1797	object *tmp;
		1798	maptile *m = op->map;
		1799	int x = op->x, y = op->y;
2008		1800
2009	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1801	mapspace &ms = m->at (x, y);
2010	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1802
2011	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1803	ms.update ();
		1804
		1805	MoveType move_on = ms.move_on;
		1806	MoveType move_slow = ms.move_slow;
		1807	MoveType move_block = ms.move_block;
2012		1808
2013	/* if nothing on this space will slow op down or be applied,	1809	/* if nothing on this space will slow op down or be applied,
2014	* no need to do checking below. have to make sure move_type	1810	* no need to do checking below. have to make sure move_type
2015	* is set, as lots of objects don't have it set - we treat that	1811	* is set, as lots of objects don't have it set - we treat that
2016	* as walking.	1812	* as walking.
…		…
2027	return 0;	1823	return 0;
2028		1824
2029	/* The objects have to be checked from top to bottom.	1825	/* The objects have to be checked from top to bottom.
2030	* Hence, we first go to the top:	1826	* Hence, we first go to the top:
2031	*/	1827	*/
2032		1828	for (object *next, *tmp = ms.top; tmp; tmp = next)
2033	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)
2034	{
2035	/* Trim the search when we find the first other spell effect
2036	* this helps performance so that if a space has 50 spell objects,
2037	* we don't need to check all of them.
2038	*/
2039	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
2040	break;
2041	}	1829	{
		1830	next = tmp->below;
2042		1831
2043	for (; tmp; tmp = tmp->below)
2044	{
2045	if (tmp == op)	1832	if (tmp == op)
2046	continue; /* Can't apply yourself */	1833	continue; /* Can't apply yourself */
2047		1834
2048	/* Check to see if one of the movement types should be slowed down.	1835	/* Check to see if one of the movement types should be slowed down.
2049	* Second check makes sure that the movement types not being slowed	1836	* Second check makes sure that the movement types not being slowed
…		…
2054	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1841	if (!QUERY_FLAG (op, FLAG_WIZPASS))
2055	{	1842	{
2056	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1843	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2057	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1844	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
2058	{	1845	{
2059
2060	float diff = tmp->move_slow_penalty * FABS (op->speed);	1846	float diff = tmp->move_slow_penalty * fabs (op->speed);
2061		1847
2062	if (op->type == PLAYER)	1848	if (op->is_player ())
2063	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1849	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
2064	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1850	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
2065	diff /= 4.0;	1851	diff /= 4.0;
2066		1852
2067	op->speed_left -= diff;	1853	op->speed_left -= diff;
2068	}	1854	}
2069	}	1855	}
…		…
2072	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	1858	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2073	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1859	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2074	{	1860	{
2075	move_apply (tmp, op, originator);	1861	move_apply (tmp, op, originator);
2076		1862
2077	if (was_destroyed (op, tag))	1863	if (op->destroyed ())
2078	return 1;	1864	return 1;
2079		1865
2080	/* what the person/creature stepped onto has moved the object	1866	/* what the person/creature stepped onto has moved the object
2081	* someplace new. Don't process any further - if we did,	1867	* someplace new. Don't process any further - if we did,
2082	* have a feeling strange problems would result.	1868	* have a feeling strange problems would result.
…		…
2092	/*	1878	/*
2093	* present_arch(arch, map, x, y) searches for any objects with	1879	* present_arch(arch, map, x, y) searches for any objects with
2094	* a matching archetype at the given map and coordinates.	1880	* a matching archetype at the given map and coordinates.
2095	* The first matching object is returned, or NULL if none.	1881	* The first matching object is returned, or NULL if none.
2096	*/	1882	*/
2097
2098	object *	1883	object *
2099	present_arch (const archetype *at, mapstruct *m, int x, int y)	1884	present_arch (const archetype *at, maptile *m, int x, int y)
2100	{	1885	{
2101	object *
2102	tmp;
2103
2104	if (m == NULL || out_of_map (m, x, y))	1886	if (!m || out_of_map (m, x, y))
2105	{	1887	{
2106	LOG (llevError, "Present_arch called outside map.\n");	1888	LOG (llevError, "Present_arch called outside map.\n");
2107	return NULL;	1889	return NULL;
2108	}	1890	}
2109	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1891
2110	if (tmp->arch == at)	1892	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
		1893	if (tmp->arch->archname == at->archname)
2111	return tmp;	1894	return tmp;
		1895
2112	return NULL;	1896	return NULL;
2113	}	1897	}
2114		1898
2115	/*	1899	/*
2116	* present(type, map, x, y) searches for any objects with	1900	* present(type, map, x, y) searches for any objects with
2117	* a matching type variable at the given map and coordinates.	1901	* a matching type variable at the given map and coordinates.
2118	* The first matching object is returned, or NULL if none.	1902	* The first matching object is returned, or NULL if none.
2119	*/	1903	*/
2120
2121	object *	1904	object *
2122	present (unsigned char type, mapstruct *m, int x, int y)	1905	present (unsigned char type, maptile *m, int x, int y)
2123	{	1906	{
2124	object *
2125	tmp;
2126
2127	if (out_of_map (m, x, y))	1907	if (out_of_map (m, x, y))
2128	{	1908	{
2129	LOG (llevError, "Present called outside map.\n");	1909	LOG (llevError, "Present called outside map.\n");
2130	return NULL;	1910	return NULL;
2131	}	1911	}
2132	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1912
		1913	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2133	if (tmp->type == type)	1914	if (tmp->type == type)
2134	return tmp;	1915	return tmp;
		1916
2135	return NULL;	1917	return NULL;
2136	}	1918	}
2137		1919
2138	/*	1920	/*
2139	* present_in_ob(type, object) searches for any objects with	1921	* present_in_ob(type, object) searches for any objects with
2140	* a matching type variable in the inventory of the given object.	1922	* a matching type variable in the inventory of the given object.
2141	* The first matching object is returned, or NULL if none.	1923	* The first matching object is returned, or NULL if none.
2142	*/	1924	*/
2143
2144	object *	1925	object *
2145	present_in_ob (unsigned char type, const object *op)	1926	present_in_ob (unsigned char type, const object *op)
2146	{	1927	{
2147	object *
2148	tmp;
2149
2150	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1928	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2151	if (tmp->type == type)	1929	if (tmp->type == type)
2152	return tmp;	1930	return tmp;
		1931
2153	return NULL;	1932	return NULL;
2154	}	1933	}
2155		1934
2156	/*	1935	/*
2157	* present_in_ob (type, str, object) searches for any objects with	1936	* present_in_ob (type, str, object) searches for any objects with
…		…
2165	* str is the string to match against. Note that we match against	1944	* str is the string to match against. Note that we match against
2166	* the object name, not the archetype name. this is so that the	1945	* the object name, not the archetype name. this is so that the
2167	* spell code can use one object type (force), but change it's name	1946	* spell code can use one object type (force), but change it's name
2168	* to be unique.	1947	* to be unique.
2169	*/	1948	*/
2170
2171	object *	1949	object *
2172	present_in_ob_by_name (int type, const char *str, const object *op)	1950	present_in_ob_by_name (int type, const char *str, const object *op)
2173	{	1951	{
2174	object *
2175	tmp;
2176
2177	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1952	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2178	{
2179	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1953	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2180	return tmp;	1954	return tmp;
2181	}	1955
2182	return NULL;	1956	return 0;
2183	}	1957	}
2184		1958
2185	/*	1959	/*
2186	* present_arch_in_ob(archetype, object) searches for any objects with	1960	* present_arch_in_ob(archetype, object) searches for any objects with
2187	* a matching archetype in the inventory of the given object.	1961	* a matching archetype in the inventory of the given object.
2188	* The first matching object is returned, or NULL if none.	1962	* The first matching object is returned, or NULL if none.
2189	*/	1963	*/
2190
2191	object *	1964	object *
2192	present_arch_in_ob (const archetype *at, const object *op)	1965	present_arch_in_ob (const archetype *at, const object *op)
2193	{	1966	{
2194	object *
2195	tmp;
2196
2197	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1967	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2198	if (tmp->arch == at)	1968	if (tmp->arch->archname == at->archname)
2199	return tmp;	1969	return tmp;
		1970
2200	return NULL;	1971	return NULL;
2201	}	1972	}
2202		1973
2203	/*	1974	/*
2204	* activate recursively a flag on an object inventory	1975	* activate recursively a flag on an object inventory
2205	*/	1976	*/
2206	void	1977	void
2207	flag_inv (object *op, int flag)	1978	flag_inv (object *op, int flag)
2208	{	1979	{
2209	object *
2210	tmp;
2211
2212	if (op->inv)
2213	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1980	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2214	{	1981	{
2215	SET_FLAG (tmp, flag);	1982	SET_FLAG (tmp, flag);
2216	flag_inv (tmp, flag);	1983	flag_inv (tmp, flag);
2217	}	1984	}
2218	} /*	1985	}
		1986
		1987	/*
2219	* desactivate recursively a flag on an object inventory	1988	* deactivate recursively a flag on an object inventory
2220	*/	1989	*/
2221	void	1990	void
2222	unflag_inv (object *op, int flag)	1991	unflag_inv (object *op, int flag)
2223	{	1992	{
2224	object *
2225	tmp;
2226
2227	if (op->inv)
2228	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1993	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2229	{	1994	{
2230	CLEAR_FLAG (tmp, flag);	1995	CLEAR_FLAG (tmp, flag);
2231	unflag_inv (tmp, flag);	1996	unflag_inv (tmp, flag);
2232	}	1997	}
2233	}
2234
2235	/*
2236	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2237	* all it's inventory (recursively).
2238	* If checksums are used, a player will get set_cheat called for
2239	* him/her-self and all object carried by a call to this function.
2240	*/
2241
2242	void
2243	set_cheat (object *op)
2244	{
2245	SET_FLAG (op, FLAG_WAS_WIZ);
2246	flag_inv (op, FLAG_WAS_WIZ);
2247	}	1998	}
2248		1999
2249	/*	2000	/*
2250	* find_free_spot(object, map, x, y, start, stop) will search for	2001	* find_free_spot(object, map, x, y, start, stop) will search for
2251	* a spot at the given map and coordinates which will be able to contain	2002	* a spot at the given map and coordinates which will be able to contain
…		…
2253	* to search (see the freearr_x/y[] definition).	2004	* to search (see the freearr_x/y[] definition).
2254	* It returns a random choice among the alternatives found.	2005	* It returns a random choice among the alternatives found.
2255	* start and stop are where to start relative to the free_arr array (1,9	2006	* start and stop are where to start relative to the free_arr array (1,9
2256	* does all 4 immediate directions). This returns the index into the	2007	* does all 4 immediate directions). This returns the index into the
2257	* array of the free spot, -1 if no spot available (dir 0 = x,y)	2008	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2258	* Note - this only checks to see if there is space for the head of the
2259	* object - if it is a multispace object, this should be called for all
2260	* pieces.
2261	* Note2: This function does correctly handle tiled maps, but does not	2009	* Note: This function does correctly handle tiled maps, but does not
2262	* inform the caller. However, insert_ob_in_map will update as	2010	* inform the caller. However, insert_ob_in_map will update as
2263	* necessary, so the caller shouldn't need to do any special work.	2011	* necessary, so the caller shouldn't need to do any special work.
2264	* Note - updated to take an object instead of archetype - this is necessary	2012	* Note - updated to take an object instead of archetype - this is necessary
2265	* because arch_blocked (now ob_blocked) needs to know the movement type	2013	* because arch_blocked (now ob_blocked) needs to know the movement type
2266	* to know if the space in question will block the object. We can't use	2014	* to know if the space in question will block the object. We can't use
2267	* the archetype because that isn't correct if the monster has been	2015	* the archetype because that isn't correct if the monster has been
2268	* customized, changed states, etc.	2016	* customized, changed states, etc.
2269	*/	2017	*/
2270
2271	int	2018	int
2272	find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop)	2019	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2273	{	2020	{
2274	int
2275	i,
2276	index = 0, flag;
2277	static int
2278	altern[SIZEOFFREE];	2021	int altern[SIZEOFFREE];
		2022	int index = 0, flag;
2279		2023
2280	for (i = start; i < stop; i++)	2024	for (int i = start; i < stop; i++)
2281	{	2025	{
2282	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2026	mapxy pos (m, x, y); pos.move (i);
2283	if (!flag)	2027
		2028	if (!pos.normalise ())
		2029	continue;
		2030
		2031	mapspace &ms = *pos;
		2032
		2033	if (ms.flags () & P_IS_ALIVE)
		2034	continue;
		2035
		2036	/* However, often
		2037	* ob doesn't have any move type (when used to place exits)
		2038	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2039	*/
		2040	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2041	{
2284	altern[index++] = i;	2042	altern [index++] = i;
		2043	continue;
		2044	}
2285		2045
2286	/* Basically, if we find a wall on a space, we cut down the search size.	2046	/* Basically, if we find a wall on a space, we cut down the search size.
2287	* In this way, we won't return spaces that are on another side of a wall.	2047	* In this way, we won't return spaces that are on another side of a wall.
2288	* This mostly work, but it cuts down the search size in all directions -	2048	* This mostly work, but it cuts down the search size in all directions -
2289	* if the space being examined only has a wall to the north and empty	2049	* if the space being examined only has a wall to the north and empty
2290	* spaces in all the other directions, this will reduce the search space	2050	* spaces in all the other directions, this will reduce the search space
2291	* to only the spaces immediately surrounding the target area, and	2051	* to only the spaces immediately surrounding the target area, and
2292	* won't look 2 spaces south of the target space.	2052	* won't look 2 spaces south of the target space.
2293	*/	2053	*/
2294	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	2054	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2055	{
2295	stop = maxfree[i];	2056	stop = maxfree[i];
		2057	continue;
		2058	}
		2059
		2060	/* Note it is intentional that we check ob - the movement type of the
		2061	* head of the object should correspond for the entire object.
		2062	*/
		2063	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2064	continue;
		2065
		2066	if (ob->blocked (pos.m, pos.x, pos.y))
		2067	continue;
		2068
		2069	altern [index++] = i;
2296	}	2070	}
		2071
2297	if (!index)	2072	if (!index)
2298	return -1;	2073	return -1;
		2074
2299	return altern[RANDOM () % index];	2075	return altern [rndm (index)];
2300	}	2076	}
2301		2077
2302	/*	2078	/*
2303	* find_first_free_spot(archetype, mapstruct, x, y) works like	2079	* find_first_free_spot(archetype, maptile, x, y) works like
2304	* find_free_spot(), but it will search max number of squares.	2080	* find_free_spot(), but it will search max number of squares.
2305	* But it will return the first available spot, not a random choice.	2081	* But it will return the first available spot, not a random choice.
2306	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2082	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2307	*/	2083	*/
2308
2309	int	2084	int
2310	find_first_free_spot (const object *ob, mapstruct *m, int x, int y)	2085	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2311	{	2086	{
2312	int
2313	i;
2314
2315	for (i = 0; i < SIZEOFFREE; i++)	2087	for (int i = 0; i < SIZEOFFREE; i++)
2316	{
2317	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2088	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2318	return i;	2089	return i;
2319	}	2090
2320	return -1;	2091	return -1;
2321	}	2092	}
2322		2093
2323	/*	2094	/*
2324	* The function permute(arr, begin, end) randomly reorders the array	2095	* The function permute(arr, begin, end) randomly reorders the array
2325	* arr[begin..end-1].	2096	* arr[begin..end-1].
		2097	* now uses a fisher-yates shuffle, old permute was broken
2326	*/	2098	*/
2327	static void	2099	static void
2328	permute (int *arr, int begin, int end)	2100	permute (int *arr, int begin, int end)
2329	{	2101	{
2330	int	2102	arr += begin;
2331	i,
2332	j,
2333	tmp,
2334	len;
2335
2336	len = end - begin;	2103	end -= begin;
2337	for (i = begin; i < end; i++)
2338	{
2339	j = begin + RANDOM () % len;
2340		2104
2341	tmp = arr[i];	2105	while (--end)
2342	arr[i] = arr[j];	2106	swap (arr [end], arr [rndm (end + 1)]);
2343	arr[j] = tmp;
2344	}
2345	}	2107	}
2346		2108
2347	/* new function to make monster searching more efficient, and effective!	2109	/* new function to make monster searching more efficient, and effective!
2348	* This basically returns a randomized array (in the passed pointer) of	2110	* This basically returns a randomized array (in the passed pointer) of
2349	* the spaces to find monsters. In this way, it won't always look for	2111	* the spaces to find monsters. In this way, it won't always look for
…		…
2352	* the 3x3 area will be searched, just not in a predictable order.	2114	* the 3x3 area will be searched, just not in a predictable order.
2353	*/	2115	*/
2354	void	2116	void
2355	get_search_arr (int *search_arr)	2117	get_search_arr (int *search_arr)
2356	{	2118	{
2357	int	2119	int i;
2358	i;
2359		2120
2360	for (i = 0; i < SIZEOFFREE; i++)	2121	for (i = 0; i < SIZEOFFREE; i++)
2361	{
2362	search_arr[i] = i;	2122	search_arr[i] = i;
2363	}
2364		2123
2365	permute (search_arr, 1, SIZEOFFREE1 + 1);	2124	permute (search_arr, 1, SIZEOFFREE1 + 1);
2366	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2125	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2367	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2126	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2368	}	2127	}
…		…
2377	* Perhaps incorrectly, but I'm making the assumption that exclude	2136	* Perhaps incorrectly, but I'm making the assumption that exclude
2378	* is actually want is going to try and move there. We need this info	2137	* is actually want is going to try and move there. We need this info
2379	* because we have to know what movement the thing looking to move	2138	* because we have to know what movement the thing looking to move
2380	* there is capable of.	2139	* there is capable of.
2381	*/	2140	*/
2382
2383	int	2141	int
2384	find_dir (mapstruct *m, int x, int y, object *exclude)	2142	find_dir (maptile *m, int x, int y, object *exclude)
2385	{	2143	{
2386	int
2387	i,
2388	max = SIZEOFFREE, mflags;	2144	int max = SIZEOFFREE, mflags;
2389	sint16	2145	MoveType move_type;
2390	nx,
2391	ny;
2392	object *
2393	tmp;
2394	mapstruct *
2395	mp;
2396	MoveType
2397	blocked,
2398	move_type;
2399		2146
2400	if (exclude && exclude->head)	2147	if (exclude && exclude->head_ () != exclude)
2401	{	2148	{
2402	exclude = exclude->head;	2149	exclude = exclude->head;
2403	move_type = exclude->move_type;	2150	move_type = exclude->move_type;
2404	}	2151	}
2405	else	2152	else
2406	{	2153	{
2407	/* If we don't have anything, presume it can use all movement types. */	2154	/* If we don't have anything, presume it can use all movement types. */
2408	move_type = MOVE_ALL;	2155	move_type = MOVE_ALL;
2409	}	2156	}
2410		2157
2411	for (i = 1; i < max; i++)	2158	for (int i = 1; i < max; i++)
2412	{	2159	{
2413	mp = m;	2160	mapxy pos (m, x, y);
2414	nx = x + freearr_x[i];	2161	pos.move (i);
2415	ny = y + freearr_y[i];
2416		2162
2417	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2163	if (!pos.normalise ())
2418	if (mflags & P_OUT_OF_MAP)
2419	{
2420	max = maxfree[i];	2164	max = maxfree[i];
2421	}
2422	else	2165	else
2423	{	2166	{
2424	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2167	mapspace &ms = *pos;
2425		2168
2426	if ((move_type & blocked) == move_type)	2169	if ((move_type & ms.move_block) == move_type)
		2170	max = maxfree [i];
		2171	else if (ms.flags () & P_IS_ALIVE)
2427	{	2172	{
2428	max = maxfree[i];	2173	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2429	}	2174	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2430	else if (mflags & P_IS_ALIVE)	2175	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2431	{
2432	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)
2433	{
2434	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2435	{
2436	break;
2437	}
2438	}
2439	if (tmp)
2440	{
2441	return freedir[i];	2176	return freedir [i];
2442	}
2443	}	2177	}
2444	}	2178	}
2445	}	2179	}
		2180
2446	return 0;	2181	return 0;
2447	}	2182	}
2448		2183
2449	/*	2184	/*
2450	* distance(object 1, object 2) will return the square of the	2185	* distance(object 1, object 2) will return the square of the
2451	* distance between the two given objects.	2186	* distance between the two given objects.
2452	*/	2187	*/
2453
2454	int	2188	int
2455	distance (const object *ob1, const object *ob2)	2189	distance (const object *ob1, const object *ob2)
2456	{	2190	{
2457	int
2458	i;
2459
2460	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2191	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2461	return i;
2462	}	2192	}
2463		2193
2464	/*	2194	/*
2465	* find_dir_2(delta-x,delta-y) will return a direction in which	2195	* find_dir_2(delta-x,delta-y) will return a direction in which
2466	* an object which has subtracted the x and y coordinates of another	2196	* an object which has subtracted the x and y coordinates of another
2467	* object, needs to travel toward it.	2197	* object, needs to travel toward it.
2468	*/	2198	*/
2469
2470	int	2199	int
2471	find_dir_2 (int x, int y)	2200	find_dir_2 (int x, int y)
2472	{	2201	{
2473	int	2202	int q;
2474	q;
2475		2203
2476	if (y)	2204	if (y)
2477	q = x * 100 / y;	2205	q = x * 100 / y;
2478	else if (x)	2206	else if (x)
2479	q = -300 * x;	2207	q = -300 * x;
…		…
2504		2232
2505	return 3;	2233	return 3;
2506	}	2234	}
2507		2235
2508	/*	2236	/*
2509	* absdir(int): Returns a number between 1 and 8, which represent
2510	* the "absolute" direction of a number (it actually takes care of
2511	* "overflow" in previous calculations of a direction).
2512	*/
2513
2514	int
2515	absdir (int d)
2516	{
2517	while (d < 1)
2518	d += 8;
2519	while (d > 8)
2520	d -= 8;
2521	return d;
2522	}
2523
2524	/*
2525	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2237	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2526	* between two directions (which are expected to be absolute (see absdir())	2238	* between two directions (which are expected to be absolute (see absdir())
2527	*/	2239	*/
2528
2529	int	2240	int
2530	dirdiff (int dir1, int dir2)	2241	dirdiff (int dir1, int dir2)
2531	{	2242	{
2532	int	2243	int d;
2533	d;
2534		2244
2535	d = abs (dir1 - dir2);	2245	d = abs (dir1 - dir2);
2536	if (d > 4)	2246	if (d > 4)
2537	d = 8 - d;	2247	d = 8 - d;
		2248
2538	return d;	2249	return d;
2539	}	2250	}
2540		2251
2541	/* peterm:	2252	/* peterm:
2542	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2253	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2545	* This basically means that if direction is 15, then it could either go	2256	* This basically means that if direction is 15, then it could either go
2546	* direction 4, 14, or 16 to get back to where we are.	2257	* direction 4, 14, or 16 to get back to where we are.
2547	* Moved from spell_util.c to object.c with the other related direction	2258	* Moved from spell_util.c to object.c with the other related direction
2548	* functions.	2259	* functions.
2549	*/	2260	*/
2550
2551	int
2552	reduction_dir[SIZEOFFREE][3] = {	2261	static const int reduction_dir[SIZEOFFREE][3] = {
2553	{0, 0, 0}, /* 0 */	2262	{0, 0, 0}, /* 0 */
2554	{0, 0, 0}, /* 1 */	2263	{0, 0, 0}, /* 1 */
2555	{0, 0, 0}, /* 2 */	2264	{0, 0, 0}, /* 2 */
2556	{0, 0, 0}, /* 3 */	2265	{0, 0, 0}, /* 3 */
2557	{0, 0, 0}, /* 4 */	2266	{0, 0, 0}, /* 4 */
…		…
2605	* find a path to that monster that we found. If not,	2314	* find a path to that monster that we found. If not,
2606	* we don't bother going toward it. Returns 1 if we	2315	* we don't bother going toward it. Returns 1 if we
2607	* can see a direct way to get it	2316	* can see a direct way to get it
2608	* Modified to be map tile aware -.MSW	2317	* Modified to be map tile aware -.MSW
2609	*/	2318	*/
2610
2611
2612	int	2319	int
2613	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2320	can_see_monsterP (maptile *m, int x, int y, int dir)
2614	{	2321	{
2615	sint16	2322	sint16 dx, dy;
2616	dx,
2617	dy;
2618	int
2619	mflags;	2323	int mflags;
2620		2324
2621	if (dir < 0)	2325	if (dir < 0)
2622	return 0; /* exit condition: invalid direction */	2326	return 0; /* exit condition: invalid direction */
2623		2327
2624	dx = x + freearr_x[dir];	2328	dx = x + freearr_x[dir];
…		…
2637	return 0;	2341	return 0;
2638		2342
2639	/* yes, can see. */	2343	/* yes, can see. */
2640	if (dir < 9)	2344	if (dir < 9)
2641	return 1;	2345	return 1;
		2346
2642	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2347	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2643	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2348	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2349	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2644	}	2350	}
2645
2646
2647		2351
2648	/*	2352	/*
2649	* can_pick(picker, item): finds out if an object is possible to be	2353	* can_pick(picker, item): finds out if an object is possible to be
2650	* picked up by the picker. Returnes 1 if it can be	2354	* picked up by the picker. Returnes 1 if it can be
2651	* picked up, otherwise 0.	2355	* picked up, otherwise 0.
…		…
2653	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2357	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2654	* core dumps if they do.	2358	* core dumps if they do.
2655	*	2359	*
2656	* Add a check so we can't pick up invisible objects (0.93.8)	2360	* Add a check so we can't pick up invisible objects (0.93.8)
2657	*/	2361	*/
2658
2659	int	2362	int
2660	can_pick (const object *who, const object *item)	2363	can_pick (const object *who, const object *item)
2661	{	2364	{
2662	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2365	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2663	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2366	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2664	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2367	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2665	}	2368	}
2666
2667		2369
2668	/*	2370	/*
2669	* create clone from object to another	2371	* create clone from object to another
2670	*/	2372	*/
2671	object *	2373	object *
2672	object_create_clone (object *asrc)	2374	object::deep_clone ()
2673	{	2375	{
2674	object *	2376	assert (("deep_clone called on non-head object", is_head ()));
2675	dst = NULL, *tmp, *src, *part, *prev, *item;
2676		2377
2677	if (!asrc)	2378	object *dst = clone ();
2678	return NULL;
2679	src = asrc;
2680	if (src->head)
2681	src = src->head;
2682		2379
2683	prev = NULL;	2380	object *prev = dst;
2684	for (part = src; part; part = part->more)	2381	for (object *part = this->more; part; part = part->more)
2685	{	2382	{
2686	tmp = get_object ();	2383	object *tmp = part->clone ();
2687	copy_object (part, tmp);
2688	tmp->x -= src->x;
2689	tmp->y -= src->y;
2690	if (!part->head)
2691	{
2692	dst = tmp;
2693	tmp->head = NULL;
2694	}
2695	else
2696	{
2697	tmp->head = dst;	2384	tmp->head = dst;
2698	}
2699	tmp->more = NULL;
2700	if (prev)
2701	prev->more = tmp;	2385	prev->more = tmp;
2702	prev = tmp;	2386	prev = tmp;
2703	}	2387	}
2704		2388
2705	/*** copy inventory ***/
2706	for (item = src->inv; item; item = item->below)	2389	for (object *item = inv; item; item = item->below)
2707	{	2390	insert_ob_in_ob (item->deep_clone (), dst);
2708	(void) insert_ob_in_ob (object_create_clone (item), dst);
2709	}
2710		2391
2711	return dst;	2392	return dst;
2712	}
2713
2714	/* return true if the object was destroyed, 0 otherwise */
2715	int
2716	was_destroyed (const object *op, tag_t old_tag)
2717	{
2718	/* checking for FLAG_FREED isn't necessary, but makes this function more
2719	* robust */
2720	return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2721	}
2722
2723	/* GROS - Creates an object using a string representing its content. */
2724
2725	/* Basically, we save the content of the string to a temp file, then call */
2726
2727	/* load_object on it. I admit it is a highly inefficient way to make things, */
2728
2729	/* but it was simple to make and allows reusing the load_object function. */
2730
2731	/* Remember not to use load_object_str in a time-critical situation. */
2732
2733	/* Also remember that multiparts objects are not supported for now. */
2734
2735	object *
2736	load_object_str (const char *obstr)
2737	{
2738	object *
2739	op;
2740	char
2741	filename[MAX_BUF];
2742
2743	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2744
2745	FILE *
2746	tempfile = fopen (filename, "w");
2747
2748	if (tempfile == NULL)
2749	{
2750	LOG (llevError, "Error - Unable to access load object temp file\n");
2751	return NULL;
2752	};
2753	fprintf (tempfile, obstr);
2754	fclose (tempfile);
2755
2756	op = get_object ();
2757
2758	object_thawer
2759	thawer (filename);
2760
2761	if (thawer)
2762	load_object (thawer, op, 0);
2763
2764	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2765	CLEAR_FLAG (op, FLAG_REMOVED);
2766
2767	return op;
2768	}	2393	}
2769		2394
2770	/* This returns the first object in who's inventory that	2395	/* This returns the first object in who's inventory that
2771	* has the same type and subtype match.	2396	* has the same type and subtype match.
2772	* returns NULL if no match.	2397	* returns NULL if no match.
2773	*/	2398	*/
2774	object *	2399	object *
2775	find_obj_by_type_subtype (const object *who, int type, int subtype)	2400	find_obj_by_type_subtype (const object *who, int type, int subtype)
2776	{	2401	{
2777	object *
2778	tmp;
2779
2780	for (tmp = who->inv; tmp; tmp = tmp->below)	2402	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2781	if (tmp->type == type && tmp->subtype == subtype)	2403	if (tmp->type == type && tmp->subtype == subtype)
2782	return tmp;	2404	return tmp;
2783		2405
2784	return NULL;	2406	return 0;
2785	}	2407	}
2786		2408
2787	/* If ob has a field named key, return the link from the list,	2409	shstr_tmp
2788	* otherwise return NULL.	2410	object::kv_get (shstr_tmp key) const
2789	*
2790	* key must be a passed in shared string - otherwise, this won't
2791	* do the desired thing.
2792	*/
2793	key_value *
2794	get_ob_key_link (const object *ob, const char *key)
2795	{	2411	{
2796	key_value *	2412	for (key_value *kv = key_values; kv; kv = kv->next)
2797	link;
2798
2799	for (link = ob->key_values; link != NULL; link = link->next)
2800	{
2801	if (link->key == key)	2413	if (kv->key == key)
		2414	return kv->value;
		2415
		2416	return shstr ();
		2417	}
		2418
		2419	void
		2420	object::kv_set (shstr_tmp key, shstr_tmp value)
		2421	{
		2422	for (key_value *kv = key_values; kv; kv = kv->next)
		2423	if (kv->key == key)
		2424	{
		2425	kv->value = value;
		2426	return;
		2427	}
		2428
		2429	key_value *kv = new key_value;
		2430
		2431	kv->next = key_values;
		2432	kv->key = key;
		2433	kv->value = value;
		2434
		2435	key_values = kv;
		2436	}
		2437
		2438	void
		2439	object::kv_del (shstr_tmp key)
		2440	{
		2441	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2442	if ((*kvp)->key == key)
		2443	{
		2444	key_value *kv = *kvp;
		2445	*kvp = (*kvp)->next;
		2446	delete kv;
		2447	return;
		2448	}
		2449	}
		2450
		2451	object::depth_iterator::depth_iterator (object *container)
		2452	: iterator_base (container)
		2453	{
		2454	while (item->inv)
		2455	item = item->inv;
		2456	}
		2457
		2458	void
		2459	object::depth_iterator::next ()
		2460	{
		2461	if (item->below)
		2462	{
		2463	item = item->below;
		2464
		2465	while (item->inv)
		2466	item = item->inv;
		2467	}
		2468	else
		2469	item = item->env;
		2470	}
		2471
		2472	const char *
		2473	object::flag_desc (char *desc, int len) const
		2474	{
		2475	char *p = desc;
		2476	bool first = true;
		2477
		2478	*p = 0;
		2479
		2480	for (int i = 0; i < NUM_FLAGS; i++)
		2481	{
		2482	if (len <= 10) // magic constant!
2802	{	2483	{
2803	return link;	2484	snprintf (p, len, ",...");
		2485	break;
2804	}	2486	}
2805	}
2806		2487
2807	return NULL;	2488	if (flag [i])
2808	}	2489	{
		2490	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2491	len -= cnt;
		2492	p += cnt;
		2493	first = false;
		2494	}
		2495	}
2809		2496
2810	/*	2497	return desc;
2811	* Returns the value of op has an extra_field for key, or NULL.	2498	}
2812	*	2499
2813	* The argument doesn't need to be a shared string.	2500	// return a suitable string describing an object in enough detail to find it
2814	*
2815	* The returned string is shared.
2816	*/
2817	const char *	2501	const char *
2818	get_ob_key_value (const object *op, const char *const key)	2502	object::debug_desc (char *info) const
2819	{	2503	{
2820	key_value *	2504	char flagdesc[512];
2821	link;	2505	char info2[256 * 4];
		2506	char *p = info;
		2507
		2508	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
		2509	count,
		2510	uuid.c_str (),
		2511	&name,
		2512	title ? ",title:\"" : "",
		2513	title ? (const char *)title : "",
		2514	title ? "\"" : "",
		2515	flag_desc (flagdesc, 512), type);
		2516
		2517	if (!flag[FLAG_REMOVED] && env)
		2518	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2519
		2520	if (map)
		2521	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
		2522
		2523	return info;
		2524	}
		2525
2822	const char *	2526	const char *
2823	canonical_key;	2527	object::debug_desc () const
		2528	{
		2529	static char info[3][256 * 4];
		2530	static int info_idx;
2824		2531
2825	canonical_key = shstr::find (key);	2532	return debug_desc (info [++info_idx % 3]);
		2533	}
2826		2534
2827	if (canonical_key == NULL)	2535	struct region *
2828	{	2536	object::region () const
2829	/* 1. There being a field named key on any object	2537	{
2830	* implies there'd be a shared string to find.	2538	return map ? map->region (x, y)
2831	* 2. Since there isn't, no object has this field.	2539	: region::default_region ();
2832	* 3. Therefore, *this* object doesn't have this field.	2540	}
2833	*/	2541
		2542	void
		2543	object::open_container (object *new_container)
		2544	{
		2545	if (container == new_container)
2834	return NULL;	2546	return;
		2547
		2548	object *old_container = container;
		2549
		2550	if (old_container)
2835	}	2551	{
		2552	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2553	return;
2836		2554
2837	/* This is copied from get_ob_key_link() above -	2555	#if 0
2838	* only 4 lines, and saves the function call overhead.	2556	// remove the "Close old_container" object.
		2557	if (object *closer = old_container->inv)
		2558	if (closer->type == CLOSE_CON)
		2559	closer->destroy ();
		2560	#endif
		2561
		2562	// make sure the container is available
		2563	esrv_send_item (this, old_container);
		2564
		2565	old_container->flag [FLAG_APPLIED] = false;
		2566	container = 0;
		2567
		2568	// client needs item update to make it work, client bug requires this to be separate
		2569	esrv_update_item (UPD_FLAGS, this, old_container);
		2570
		2571	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
		2572	play_sound (sound_find ("chest_close"));
		2573	}
		2574
		2575	if (new_container)
		2576	{
		2577	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2578	return;
		2579
		2580	// TODO: this does not seem to serve any purpose anymore?
		2581	#if 0
		2582	// insert the "Close Container" object.
		2583	if (archetype *closer = new_container->other_arch)
		2584	{
		2585	object *closer = new_container->other_arch->instance ();
		2586	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2587	new_container->insert (closer);
		2588	}
		2589	#endif
		2590
		2591	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
		2592
		2593	// make sure the container is available, client bug requires this to be separate
		2594	esrv_send_item (this, new_container);
		2595
		2596	new_container->flag [FLAG_APPLIED] = true;
		2597	container = new_container;
		2598
		2599	// client needs flag change
		2600	esrv_update_item (UPD_FLAGS, this, new_container);
		2601	esrv_send_inventory (this, new_container);
		2602	play_sound (sound_find ("chest_open"));
		2603	}
		2604	// else if (!old_container->env && contr && contr->ns)
		2605	// contr->ns->floorbox_reset ();
		2606	}
		2607
		2608	object *
		2609	object::force_find (shstr_tmp name)
		2610	{
		2611	/* cycle through his inventory to look for the MARK we want to
		2612	* place
2839	*/	2613	*/
2840	for (link = op->key_values; link != NULL; link = link->next)	2614	for (object *tmp = inv; tmp; tmp = tmp->below)
2841	{	2615	if (tmp->type == FORCE && tmp->slaying == name)
2842	if (link->key == canonical_key)	2616	return splay (tmp);
2843	{	2617
2844	return link->value;
2845	}
2846	}
2847	return NULL;	2618	return 0;
2848	}	2619	}
2849		2620
		2621	//-GPL
2850		2622
2851	/*	2623	void
2852	* Updates the canonical_key in op to value.	2624	object::force_set_timer (int duration)
2853	*
2854	* canonical_key is a shared string (value doesn't have to be).
2855	*
2856	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2857	* keys.
2858	*
2859	* Returns TRUE on success.
2860	*/
2861	int
2862	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2863	{	2625	{
2864	key_value *	2626	this->duration = 1;
2865	field = NULL, *last = NULL;	2627	this->speed_left = -1.f;
2866		2628
2867	for (field = op->key_values; field != NULL; field = field->next)	2629	this->set_speed (duration ? 1.f / duration : 0.f);
2868	{	2630	}
2869	if (field->key != canonical_key)
2870	{
2871	last = field;
2872	continue;
2873	}
2874		2631
2875	if (value)	2632	object *
2876	field->value = value;	2633	object::force_add (shstr_tmp name, int duration)
2877	else	2634	{
2878	{	2635	if (object *force = force_find (name))
2879	/* Basically, if the archetype has this key set,	2636	force->destroy ();
2880	* we need to store the null value so when we save
2881	* it, we save the empty value so that when we load,
2882	* we get this value back again.
2883	*/
2884	if (get_ob_key_link (&op->arch->clone, canonical_key))
2885	field->value = 0;
2886	else
2887	{
2888	if (last)
2889	last->next = field->next;
2890	else
2891	op->key_values = field->next;
2892		2637
2893	delete	2638	object *force = get_archetype (FORCE_NAME);
2894	field;
2895	}
2896	}
2897	return TRUE;
2898	}
2899	/* IF we get here, key doesn't exist */
2900		2639
2901	/* No field, we'll have to add it. */	2640	force->slaying = name;
		2641	force->force_set_timer (duration);
		2642	force->flag [FLAG_APPLIED] = true;
2902		2643
2903	if (!add_key)	2644	return insert (force);
2904	{	2645	}
2905	return FALSE;	2646
2906	}	2647	void
2907	/* There isn't any good reason to store a null	2648	object::play_sound (faceidx sound) const
2908	* value in the key/value list. If the archetype has	2649	{
2909	* this key, then we should also have it, so shouldn't	2650	if (!sound)
2910	* be here. If user wants to store empty strings,
2911	* should pass in ""
2912	*/
2913	if (value == NULL)
2914	return TRUE;	2651	return;
2915		2652
2916	field = new key_value;	2653	if (is_on_map ())
2917		2654	map->play_sound (sound, x, y);
2918	field->key = canonical_key;	2655	else if (object *pl = in_player ())
2919	field->value = value;	2656	pl->contr->play_sound (sound);
2920	/* Usual prepend-addition. */
2921	field->next = op->key_values;
2922	op->key_values = field;
2923
2924	return TRUE;
2925	}	2657	}
2926		2658
2927	/*	2659	void
2928	* Updates the key in op to value.	2660	object::say_msg (const char *msg) const
2929	*
2930	* If add_key is FALSE, this will only update existing keys,
2931	* and not add new ones.
2932	* In general, should be little reason FALSE is ever passed in for add_key
2933	*
2934	* Returns TRUE on success.
2935	*/
2936	int
2937	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2938	{	2661	{
2939	shstr	2662	if (is_on_map ())
2940	key_ (key);	2663	map->say_msg (msg, x, y);
2941		2664	else if (object *pl = in_player ())
2942	return set_ob_key_value_s (op, key_, value, add_key);	2665	pl->contr->play_sound (sound);
2943	}	2666	}
		2667
		2668	void
		2669	object::make_noise ()
		2670	{
		2671	// we do not model noise in the map, so instead put
		2672	// a temporary light into the noise source
		2673	// could use the map instead, but that's less reliable for our
		2674	// goal, which is to make invisibility a bit harder to exploit
		2675
		2676	// currently only works sensibly for players
		2677	if (!is_player ())
		2678	return;
		2679
		2680	// find old force, or create new one
		2681	object *force = force_find (shstr_noise_force);
		2682
		2683	if (force)
		2684	force->speed_left = -1.f; // patch old speed up
		2685	else
		2686	{
		2687	force = archetype::get (shstr_noise_force);
		2688
		2689	force->slaying = shstr_noise_force;
		2690	force->stats.food = 1;
		2691	force->speed_left = -1.f;
		2692
		2693	force->set_speed (1.f / 4.f);
		2694	force->flag [FLAG_IS_USED_UP] = true;
		2695	force->flag [FLAG_APPLIED] = true;
		2696
		2697	insert (force);
		2698	}
		2699	}
		2700
		2701	void object::change_move_type (MoveType mt)
		2702	{
		2703	if (move_type == mt)
		2704	return;
		2705
		2706	if (is_on_map ())
		2707	{
		2708	// we are on the map, so handle move_on/off effects
		2709	remove ();
		2710	move_type = mt;
		2711	map->insert (this, x, y, this);
		2712	}
		2713	else
		2714	move_type = mt;
		2715	}
		2716

Diff Legend

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