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.46 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.339 by root, Fri Jul 2 17:39:23 2010 UTC

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

Diff Legend

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