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.113 by root, Tue Jan 9 21:32:41 2007 UTC vs.
Revision 1.300 by root, Mon Nov 9 03:08:23 2009 UTC

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

Diff Legend

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