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

Diff Legend

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