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.51 by root, Sun Sep 17 16:21:53 2006 UTC vs.
Revision 1.345 by root, Sun May 1 16:58:15 2011 UTC

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

Diff Legend

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