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

Diff Legend

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