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

Diff Legend

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