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.73 by root, Wed Dec 20 01:19:11 2006 UTC vs.
Revision 1.318 by root, Sat Apr 3 02:27:24 2010 UTC

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

Diff Legend

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