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

Diff Legend

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