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

Diff Legend

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