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

Diff Legend

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