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.42 by root, Thu Sep 14 01:19:47 2006 UTC vs.
Revision 1.315 by root, Fri Mar 26 21:43:43 2010 UTC

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

Diff Legend

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