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.78 by root, Fri Dec 22 16:34:00 2006 UTC vs.
Revision 1.349 by root, Sun May 8 11:44:43 2011 UTC

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

Diff Legend

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