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

Diff Legend

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