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

Diff Legend

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