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.68 by root, Mon Dec 18 02:35:00 2006 UTC vs.
Revision 1.364 by root, Sat Sep 16 22:17:42 2017 UTC

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

Diff Legend

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