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.147 by root, Sat May 12 16:06:42 2007 UTC vs.
Revision 1.350 by root, Sun May 8 12:40:41 2011 UTC

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

Diff Legend

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