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.69 by root, Mon Dec 18 03:00:02 2006 UTC vs.
Revision 1.366 by root, Sat Nov 17 23:40:00 2018 UTC

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

Diff Legend

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