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.79 by root, Sat Dec 23 06:30:49 2006 UTC vs.
Revision 1.366 by root, Sat Nov 17 23:40:00 2018 UTC

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

Diff Legend

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