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.169 by root, Wed Aug 1 01:07:42 2007 UTC vs.
Revision 1.252 by root, Mon Aug 11 23:23:41 2008 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* 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
10	* the Free Software Foundation, either version 3 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
…		…
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
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>
33	#include <sproto.h>	29	#include <sproto.h>
34	#include <loader.h>	30	#include <loader.h>
35		31
36	#include <bitset>	32	#include <bitset>
37		33
38	int nrofallocobjects = 0;	34	UUID UUID::cur;
39	static UUID uuid;	35	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
41		37
42	objectvec objects;	38	objectvec objects;
43	activevec actives;	39	activevec actives;
44		40
45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	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,
46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	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
47	};	46	};
48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	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,
49	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	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
50	};	52	};
51	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	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,
52	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	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
53	};	58	};
54	int freedir[SIZEOFFREE] = {	59	int freedir[SIZEOFFREE] = {
55	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	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,
56	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	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
57	};	64	};
58		65
59	static void	66	static void
60	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
61	{	68	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
63		70	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		73	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	74	}
79		75
80	static void	76	static void
81	read_uuid (void)	77	read_uuid (void)
82	{	78	{
83	char filename[MAX_BUF];	79	char filename[MAX_BUF];
84		80
85	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
86		84
87	FILE *fp;	85	FILE *fp;
88		86
89	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
90	{	88	{
91	if (errno == ENOENT)	89	if (errno == ENOENT)
92	{	90	{
93	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	92	UUID::cur.seq = 0;
95	write_uuid ();	93	write_uuid (UUID_GAP, true);
96	return;	94	return;
97	}	95	}
98		96
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	98	_exit (1);
101	}	99	}
102		100
103	int version;	101	UUID::BUF buf;
104	unsigned long long uid;	102	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
106	{	106	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	108	_exit (1);
109	}	109	}
110		110
111	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	112
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
114	fclose (fp);	114	fclose (fp);
115	}	115	}
116		116
117	UUID	117	UUID
118	gen_uuid ()	118	UUID::gen ()
119	{	119	{
120	UUID uid;	120	UUID uid;
121		121
122	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
123		123
124	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
126		130
127	return uid;	131	return uid;
128	}	132	}
129		133
130	void	134	void
131	init_uuid ()	135	UUID::init ()
132	{	136	{
133	read_uuid ();	137	read_uuid ();
134	}	138	}
135		139
136	/* 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. */
137	static int	141	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	143	{
140	key_value *wants_field;
141
142	/* 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
143	* 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
144	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
145	*/	147	*/
146		148
147	/* For each field in wants, */	149	/* For each field in wants, */
148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	150	for (key_value *kv = wants->key_values; kv; kv = kv->next)
149	{	151	if (has->kv_get (kv->key) != kv->value)
150	key_value *has_field;	152	return false;
151
152	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);
154
155	if (has_field == NULL)
156	{
157	/* No field with that name. */
158	return FALSE;
159	}
160
161	/* Found the matching field. */
162	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167
168	/* If we get here, we found a match. Now for the next field in wants. */
169	}
170		153
171	/* 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. */
172	return TRUE;	155	return true;
173	}	156	}
174		157
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	159	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	160	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	161	{
179	/* 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,
180	* so we need to run the comparison *twice*. :(	163	* so we need to run the comparison *twice*. :(
181	*/	164	*/
182	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);
183	}	167	}
184		168
185	/* 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
186	* they can be merged together.	170	* they can be merged together.
187	*	171	*
…		…
202	|| ob1->speed != ob2->speed	186	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	187	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	188	|| ob1->name != ob2->name)
205	return 0;	189	return 0;
206		190
207	//TODO: this ain't working well, use nicer and correct overflow check	191	/* Do not merge objects if nrof would overflow. First part checks
208	/* 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
209	* 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
210	* used to store nrof).	194	* nrof values.
211	*/	195	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	196	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	197	return 0;
214		198
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	199	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* This is to the comparison of the flags below will be OK. We	200	* This is to the comparison of the flags below will be OK. We
217	* just can't ignore the been applied or identified flags, as they	201	* just can't ignore the been applied or identified flags, as they
218	* are not equal - just if it has been identified, the been_applied	202	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	203	* flags lose any meaning.
220	*/	204	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	205	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		207
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		210
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	211	if (ob1->arch->archname != ob2->arch->archname
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	212	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	213	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	214	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	215	|| ob1->weight != ob2->weight
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
235	|| ob1->attacktype != ob2->attacktype	216	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	217	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	218	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	219	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	220	|| ob1->value != ob2->value
240	|| ob1->animation_id != ob2->animation_id	221	|| ob1->animation_id != ob2->animation_id
		222	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
241	|| ob1->client_type != ob2->client_type	223	|| ob1->client_type != ob2->client_type
242	|| ob1->materialname != ob2->materialname	224	|| ob1->materialname != ob2->materialname
243	|| ob1->lore != ob2->lore	225	|| ob1->lore != ob2->lore
244	|| ob1->subtype != ob2->subtype	226	|| ob1->subtype != ob2->subtype
245	|| ob1->move_type != ob2->move_type	227	|| ob1->move_type != ob2->move_type
246	|| ob1->move_block != ob2->move_block	228	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	229	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	230	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	231	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	232	|| ob1->move_slow != ob2->move_slow
251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	233	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		234	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		235	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
252	return 0;	236	return 0;
253		237
		238	if ((ob1->flag ^ ob2->flag)
		239	.reset (FLAG_INV_LOCKED)
		240	.reset (FLAG_CLIENT_SENT)
		241	.reset (FLAG_REMOVED)
		242	.any ())
		243	return 0;
		244
254	/* This is really a spellbook check - really, we should	245	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	246	* not merge objects with real inventories, as splitting them
		247	* is hard.
256	*/	248	*/
257	if (ob1->inv || ob2->inv)	249	if (ob1->inv || ob2->inv)
258	{	250	{
259	/* if one object has inventory but the other doesn't, not equiv */	251	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	252	return 0; /* inventories differ in length */
261	return 0;
262		253
263	/* Now check to see if the two inventory objects could merge */	254	if (ob1->inv->below || ob2->inv->below)
		255	return 0; /* more than one object in inv */
		256
264	if (!object::can_merge (ob1->inv, ob2->inv))	257	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	258	return 0; /* inventory objects differ */
266		259
267	/* inventory ok - still need to check rest of this object to see	260	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	261	* if it is valid.
269	*/	262	*/
270	}	263	}
…		…
289	if (ob1->level != ob2->level)	282	if (ob1->level != ob2->level)
290	return 0;	283	return 0;
291	break;	284	break;
292	}	285	}
293		286
294	if (ob1->key_values != NULL || ob2->key_values != NULL)	287	if (ob1->key_values || ob2->key_values)
295	{	288	{
296	/* At least one of these has key_values. */	289	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	290	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	291	return 0; /* One has fields, but the other one doesn't. */
299	return 0;	292
300	else if (!compare_ob_value_lists (ob1, ob2))	293	if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	294	return 0;
302	}	295	}
303		296
304	if (ob1->self || ob2->self)	297	if (ob1->self || ob2->self)
305	{	298	{
306	ob1->optimise ();	299	ob1->optimise ();
307	ob2->optimise ();	300	ob2->optimise ();
308		301
309	if (ob1->self || ob2->self)	302	if (ob1->self || ob2->self)
		303	{
		304	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		305	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		306
		307	if (k1 != k2)
		308	return 0;
		309
		310	if (k1 == 0)
		311	return 1;
		312
310	if (!cfperl_can_merge (ob1, ob2))	313	if (!cfperl_can_merge (ob1, ob2))
311	return 0;	314	return 0;
		315	}
312	}	316	}
313		317
314	/* Everything passes, must be OK. */	318	/* Everything passes, must be OK. */
315	return 1;	319	return 1;
316	}	320	}
317		321
		322	// find player who can see this object
		323	object *
		324	object::visible_to () const
		325	{
		326	if (client_visible () && !flag [FLAG_REMOVED])
		327	{
		328	// see if we are in a container of sorts
		329	if (env)
		330	{
		331	// the player inventory itself is always visible
		332	if (env->type == PLAYER)
		333	return env;
		334
		335	// else a player could have our env open
		336	object *envest = env->outer_env ();
		337
		338	// the player itself is always on a map, so we will find him here
		339	// even if our inv is in a player.
		340	if (envest->is_on_map ())
		341	if (object *pl = envest->ms ().player ())
		342	if (pl->container == env)
		343	return pl;
		344	}
		345	else
		346	{
		347	// maybe there is a player standing on the same mapspace
		348	// this will catch the case where "this" is a player
		349	if (object *pl = ms ().player ())
		350	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
		351	|| this == pl->container)
		352	return pl;
		353	}
		354	}
		355
		356	return 0;
		357	}
		358
		359	// adjust weight per container type ("of holding")
		360	static sint32
		361	weight_adjust_for (object *op, sint32 weight)
		362	{
		363	return op->type == CONTAINER
		364	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		365	: weight;
		366	}
		367
318	/*	368	/*
		369	* adjust_weight(object, weight) adds the specified weight to an object,
		370	* and also updates how much the environment(s) is/are carrying.
		371	*/
		372	static void
		373	adjust_weight (object *op, sint32 weight)
		374	{
		375	while (op)
		376	{
		377	// adjust by actual difference to account for rounding errors
		378	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		379	weight = weight_adjust_for (op, op->carrying)
		380	- weight_adjust_for (op, op->carrying - weight);
		381
		382	if (!weight)
		383	return;
		384
		385	op->carrying += weight;
		386
		387	if (object *pl = op->visible_to ())
		388	if (pl != op) // player is handled lazily
		389	esrv_update_item (UPD_WEIGHT, pl, op);
		390
		391	op = op->env;
		392	}
		393	}
		394
		395	/*
319	* sum_weight() is a recursive function which calculates the weight	396	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	397	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	398	* containers are carrying, and sums it up.
322	*/	399	*/
323	long	400	void
324	sum_weight (object *op)	401	object::update_weight ()
325	{	402	{
326	long sum;	403	sint32 sum = 0;
327	object *inv;
328		404
329	for (sum = 0, inv = op->inv; inv; inv = inv->below)	405	for (object *op = inv; op; op = op->below)
330	{	406	{
331	if (inv->inv)	407	if (op->inv)
332	sum_weight (inv);	408	op->update_weight ();
333		409
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	410	sum += op->total_weight ();
		411	}
		412
		413	sum = weight_adjust_for (this, sum);
		414
		415	if (sum != carrying)
335	}	416	{
336
337	if (op->type == CONTAINER && op->stats.Str)
338	sum = (sum * (100 - op->stats.Str)) / 100;
339
340	if (op->carrying != sum)
341	op->carrying = sum;	417	carrying = sum;
342		418
343	return sum;	419	if (object *pl = visible_to ())
		420	if (pl != this) // player is handled lazily
		421	esrv_update_item (UPD_WEIGHT, pl, this);
		422	}
344	}	423	}
345		424
346	/**	425	/*
347	* Return the outermost environment object for a given object.	426	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
348	*/
349
350	object *
351	object_get_env_recursive (object *op)
352	{
353	while (op->env != NULL)
354	op = op->env;
355	return op;
356	}
357
358	/*
359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
360	* Some error messages.
361	* The result of the dump is stored in the static global errmsg array.
362	*/	427	*/
363	char *	428	char *
364	dump_object (object *op)	429	dump_object (object *op)
365	{	430	{
366	if (!op)	431	if (!op)
…		…
374	/*	439	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	440	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	441	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	442	* If it's not a multi-object, it is returned.
378	*/	443	*/
379
380	object *	444	object *
381	get_nearest_part (object *op, const object *pl)	445	get_nearest_part (object *op, const object *pl)
382	{	446	{
383	object *tmp, *closest;	447	object *tmp, *closest;
384	int last_dist, i;	448	int last_dist, i;
385		449
386	if (op->more == NULL)	450	if (!op->more)
387	return op;	451	return op;
		452
388	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	453	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		454	tmp;
		455	tmp = tmp->more)
389	if ((i = distance (tmp, pl)) < last_dist)	456	if ((i = distance (tmp, pl)) < last_dist)
390	closest = tmp, last_dist = i;	457	closest = tmp, last_dist = i;
		458
391	return closest;	459	return closest;
392	}	460	}
393		461
394	/*	462	/*
395	* Returns the object which has the count-variable equal to the argument.	463	* Returns the object which has the count-variable equal to the argument.
		464	* VERRRY slow.
396	*/	465	*/
397	object *	466	object *
398	find_object (tag_t i)	467	find_object (tag_t i)
399	{	468	{
400	for_all_objects (op)	469	for_all_objects (op)
…		…
411	*/	480	*/
412	object *	481	object *
413	find_object_name (const char *str)	482	find_object_name (const char *str)
414	{	483	{
415	shstr_cmp str_ (str);	484	shstr_cmp str_ (str);
416	object *op;
417		485
		486	if (str_)
418	for_all_objects (op)	487	for_all_objects (op)
419	if (op->name == str_)	488	if (op->name == str_)
420	break;	489	return op;
421		490
422	return op;	491	return 0;
423	}
424
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}	492	}
430		493
431	/*	494	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	495	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	496	* skill and experience objects.
		497	* ACTUALLY NO! investigate! TODO
434	*/	498	*/
435	void	499	void
436	object::set_owner (object *owner)	500	object::set_owner (object *owner)
437	{	501	{
		502	// allow objects which own objects
438	if (!owner)	503	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	504	while (owner->owner)
449	owner = owner->owner;	505	owner = owner->owner;
		506
		507	if (flag [FLAG_FREED])
		508	{
		509	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		510	return;
		511	}
450		512
451	this->owner = owner;	513	this->owner = owner;
452	}	514	}
453		515
454	int	516	int
…		…
532	}	594	}
533		595
534	op->key_values = 0;	596	op->key_values = 0;
535	}	597	}
536		598
537	object &	599	/*
538	object::operator =(const object &src)	600	* copy_to first frees everything allocated by the dst object,
		601	* and then copies the contents of itself into the second
		602	* object, allocating what needs to be allocated. Basically, any
		603	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		604	* if the first object is freed, the pointers in the new object
		605	* will point at garbage.
		606	*/
		607	void
		608	object::copy_to (object *dst)
539	{	609	{
540	bool is_freed = flag [FLAG_FREED];	610	dst->remove ();
541	bool is_removed = flag [FLAG_REMOVED];
542
543	*(object_copy *)this = src;	611	*(object_copy *)dst = *this;
544
545	flag [FLAG_FREED] = is_freed;
546	flag [FLAG_REMOVED] = is_removed;	612	dst->flag [FLAG_REMOVED] = true;
547		613
548	/* Copy over key_values, if any. */	614	/* Copy over key_values, if any. */
549	if (src.key_values)	615	if (key_values)
550	{	616	{
551	key_value *tail = 0;	617	key_value *tail = 0;
552	key_values = 0;	618	dst->key_values = 0;
553		619
554	for (key_value *i = src.key_values; i; i = i->next)	620	for (key_value *i = key_values; i; i = i->next)
555	{	621	{
556	key_value *new_link = new key_value;	622	key_value *new_link = new key_value;
557		623
558	new_link->next = 0;	624	new_link->next = 0;
559	new_link->key = i->key;	625	new_link->key = i->key;
560	new_link->value = i->value;	626	new_link->value = i->value;
561		627
562	/* Try and be clever here, too. */	628	/* Try and be clever here, too. */
563	if (!key_values)	629	if (!dst->key_values)
564	{	630	{
565	key_values = new_link;	631	dst->key_values = new_link;
566	tail = new_link;	632	tail = new_link;
567	}	633	}
568	else	634	else
569	{	635	{
570	tail->next = new_link;	636	tail->next = new_link;
571	tail = new_link;	637	tail = new_link;
572	}	638	}
573	}	639	}
574	}	640	}
575	}
576
577	/*
578	* copy_to first frees everything allocated by the dst object,
579	* and then copies the contents of itself into the second
580	* object, allocating what needs to be allocated. Basically, any
581	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
582	* if the first object is freed, the pointers in the new object
583	* will point at garbage.
584	*/
585	void
586	object::copy_to (object *dst)
587	{
588	*dst = *this;
589		641
590	if (speed < 0)	642	if (speed < 0)
591	dst->speed_left = speed_left - rndm ();	643	dst->speed_left -= rndm ();
592		644
593	dst->set_speed (dst->speed);	645	dst->set_speed (dst->speed);
594	}	646	}
595		647
596	void	648	void
597	object::instantiate ()	649	object::instantiate ()
598	{	650	{
599	if (!uuid.seq) // HACK	651	if (!uuid.seq) // HACK
600	uuid = gen_uuid ();	652	uuid = UUID::gen ();
601		653
602	speed_left = -0.1f;	654	speed_left = -0.1f;
603	/* copy the body_info to the body_used - this is only really	655	/* copy the body_info to the body_used - this is only really
604	* need for monsters, but doesn't hurt to do it for everything.	656	* need for monsters, but doesn't hurt to do it for everything.
605	* by doing so, when a monster is created, it has good starting	657	* by doing so, when a monster is created, it has good starting
…		…
615	object *	667	object *
616	object::clone ()	668	object::clone ()
617	{	669	{
618	object *neu = create ();	670	object *neu = create ();
619	copy_to (neu);	671	copy_to (neu);
		672	neu->map = map; // not copied by copy_to
620	return neu;	673	return neu;
621	}	674	}
622		675
623	/*	676	/*
624	* If an object with the IS_TURNABLE() flag needs to be turned due	677	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
675	* UP_OBJ_FACE: only the objects face has changed.	728	* UP_OBJ_FACE: only the objects face has changed.
676	*/	729	*/
677	void	730	void
678	update_object (object *op, int action)	731	update_object (object *op, int action)
679	{	732	{
680	if (op == NULL)	733	if (!op)
681	{	734	{
682	/* this should never happen */	735	/* this should never happen */
683	LOG (llevDebug, "update_object() called for NULL object.\n");	736	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
684	return;	737	return;
685	}	738	}
686		739
687	if (op->env)	740	if (!op->is_on_map ())
688	{	741	{
689	/* Animation is currently handled by client, so nothing	742	/* Animation is currently handled by client, so nothing
690	* to do in this case.	743	* to do in this case.
691	*/	744	*/
692	return;	745	return;
693	}	746	}
694
695	/* If the map is saving, don't do anything as everything is
696	* going to get freed anyways.
697	*/
698	if (!op->map || op->map->in_memory == MAP_SAVING)
699	return;
700		747
701	/* make sure the object is within map boundaries */	748	/* make sure the object is within map boundaries */
702	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	749	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
703	{	750	{
704	LOG (llevError, "update_object() called for object out of map!\n");	751	LOG (llevError, "update_object() called for object out of map!\n");
…		…
715	else if (action == UP_OBJ_INSERT)	762	else if (action == UP_OBJ_INSERT)
716	{	763	{
717	// this is likely overkill, TODO: revisit (schmorp)	764	// this is likely overkill, TODO: revisit (schmorp)
718	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	765	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
719	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	766	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
720	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
721	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	767	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
722	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	768	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
723	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	769	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
724	|| (m.move_on | op->move_on ) != m.move_on	770	|| (m.move_on | op->move_on ) != m.move_on
725	|| (m.move_off | op->move_off ) != m.move_off	771	|| (m.move_off | op->move_off ) != m.move_off
726	|| (m.move_slow | op->move_slow) != m.move_slow	772	|| (m.move_slow | op->move_slow) != m.move_slow
727	/* This isn't perfect, but I don't expect a lot of objects to	773	/* This isn't perfect, but I don't expect a lot of objects to
728	* to have move_allow right now.	774	* have move_allow right now.
729	*/	775	*/
730	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	776	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
731	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	777	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
732	m.flags_ = 0;	778	m.flags_ = 0;
733	}	779	}
…		…
764	static int object_count;	810	static int object_count;
765		811
766	void object::link ()	812	void object::link ()
767	{	813	{
768	assert (!index);//D	814	assert (!index);//D
769	uuid = gen_uuid ();	815	uuid = UUID::gen ();
770	count = ++object_count;	816	count = ++object_count;
771		817
772	refcnt_inc ();	818	refcnt_inc ();
773	objects.insert (this);	819	objects.insert (this);
774	}	820	}
…		…
847	object::destroy_inv (bool drop_to_ground)	893	object::destroy_inv (bool drop_to_ground)
848	{	894	{
849	// need to check first, because the checks below might segfault	895	// need to check first, because the checks below might segfault
850	// as we might be on an invalid mapspace and crossfire code	896	// as we might be on an invalid mapspace and crossfire code
851	// is too buggy to ensure that the inventory is empty.	897	// is too buggy to ensure that the inventory is empty.
852	// corollary: if you create arrows etc. with stuff in tis inventory,	898	// corollary: if you create arrows etc. with stuff in its inventory,
853	// cf will crash below with off-map x and y	899	// cf will crash below with off-map x and y
854	if (!inv)	900	if (!inv)
855	return;	901	return;
856		902
857	/* Only if the space blocks everything do we not process -	903	/* Only if the space blocks everything do we not process -
858	* if some form of movement is allowed, let objects	904	* if some form of movement is allowed, let objects
859	* drop on that space.	905	* drop on that space.
860	*/	906	*/
861	if (!drop_to_ground	907	if (!drop_to_ground
862	|| !map	908	|| !map
863	|| map->in_memory != MAP_IN_MEMORY	909	|| map->in_memory != MAP_ACTIVE
864	|| map->nodrop	910	|| map->no_drop
865	|| ms ().move_block == MOVE_ALL)	911	|| ms ().move_block == MOVE_ALL)
866	{	912	{
867	while (inv)	913	while (inv)
868	{
869	inv->destroy_inv (drop_to_ground);
870	inv->destroy ();	914	inv->destroy (true);
871	}
872	}	915	}
873	else	916	else
874	{ /* Put objects in inventory onto this space */	917	{ /* Put objects in inventory onto this space */
875	while (inv)	918	while (inv)
876	{	919	{
…		…
880	|| op->flag [FLAG_NO_DROP]	923	|| op->flag [FLAG_NO_DROP]
881	|| op->type == RUNE	924	|| op->type == RUNE
882	|| op->type == TRAP	925	|| op->type == TRAP
883	|| op->flag [FLAG_IS_A_TEMPLATE]	926	|| op->flag [FLAG_IS_A_TEMPLATE]
884	|| op->flag [FLAG_DESTROY_ON_DEATH])	927	|| op->flag [FLAG_DESTROY_ON_DEATH])
885	op->destroy ();	928	op->destroy (true);
886	else	929	else
887	map->insert (op, x, y);	930	map->insert (op, x, y);
888	}	931	}
889	}	932	}
890	}	933	}
…		…
894	object *op = new object;	937	object *op = new object;
895	op->link ();	938	op->link ();
896	return op;	939	return op;
897	}	940	}
898		941
		942	static struct freed_map : maptile
		943	{
		944	freed_map ()
		945	{
		946	path = "<freed objects map>";
		947	name = "/internal/freed_objects_map";
		948	width = 3;
		949	height = 3;
		950	no_drop = 1;
		951	no_reset = 1;
		952
		953	alloc ();
		954	in_memory = MAP_ACTIVE;
		955	}
		956
		957	~freed_map ()
		958	{
		959	destroy ();
		960	}
		961	} freed_map; // freed objects are moved here to avoid crashes
		962
899	void	963	void
900	object::do_destroy ()	964	object::do_destroy ()
901	{	965	{
902	attachable::do_destroy ();
903
904	if (flag [FLAG_IS_LINKED])	966	if (flag [FLAG_IS_LINKED])
905	remove_button_link (this);	967	remove_button_link (this);
906		968
907	if (flag [FLAG_FRIENDLY])	969	if (flag [FLAG_FRIENDLY])
908	remove_friendly_object (this);	970	remove_friendly_object (this);
909		971
910	if (!flag [FLAG_REMOVED])
911	remove ();	972	remove ();
912		973
913	destroy_inv (true);	974	attachable::do_destroy ();
914		975
915	deactivate ();	976	deactivate ();
916	unlink ();	977	unlink ();
917		978
918	flag [FLAG_FREED] = 1;	979	flag [FLAG_FREED] = 1;
919		980
920	// hack to ensure that freed objects still have a valid map	981	// hack to ensure that freed objects still have a valid map
921	{
922	static maptile *freed_map; // freed objects are moved here to avoid crashes
923
924	if (!freed_map)
925	{
926	freed_map = new maptile;
927
928	freed_map->name = "/internal/freed_objects_map";
929	freed_map->width = 3;
930	freed_map->height = 3;
931
932	freed_map->alloc ();
933	freed_map->in_memory = MAP_IN_MEMORY;
934	}
935
936	map = freed_map;	982	map = &freed_map;
937	x = 1;	983	x = 1;
938	y = 1;	984	y = 1;
939	}
940		985
941	if (more)	986	if (more)
942	{	987	{
943	more->destroy ();	988	more->destroy ();
944	more = 0;	989	more = 0;
…		…
957	object::destroy (bool destroy_inventory)	1002	object::destroy (bool destroy_inventory)
958	{	1003	{
959	if (destroyed ())	1004	if (destroyed ())
960	return;	1005	return;
961		1006
		1007	if (!is_head () && !head->destroyed ())
		1008	{
		1009	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1010	head->destroy (destroy_inventory);
		1011	return;
		1012	}
		1013
962	if (destroy_inventory)	1014	destroy_inv (!destroy_inventory);
963	destroy_inv (false);
964		1015
		1016	if (is_head ())
		1017	if (sound_destroy)
965	play_sound (sound_die);	1018	play_sound (sound_destroy);
		1019	else if (flag [FLAG_MONSTER])
		1020	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
966		1021
967	attachable::destroy ();	1022	attachable::destroy ();
968	}
969
970	/*
971	* sub_weight() recursively (outwards) subtracts a number from the
972	* weight of an object (and what is carried by it's environment(s)).
973	*/
974	void
975	sub_weight (object *op, signed long weight)
976	{
977	while (op != NULL)
978	{
979	if (op->type == CONTAINER)
980	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
981
982	op->carrying -= weight;
983	op = op->env;
984	}
985	}	1023	}
986		1024
987	/* op->remove ():	1025	/* op->remove ():
988	* This function removes the object op from the linked list of objects	1026	* This function removes the object op from the linked list of objects
989	* which it is currently tied to. When this function is done, the	1027	* which it is currently tied to. When this function is done, the
…		…
995	object::do_remove ()	1033	object::do_remove ()
996	{	1034	{
997	object *tmp, *last = 0;	1035	object *tmp, *last = 0;
998	object *otmp;	1036	object *otmp;
999		1037
1000	if (QUERY_FLAG (this, FLAG_REMOVED))	1038	if (flag [FLAG_REMOVED])
1001	return;	1039	return;
1002		1040
1003	SET_FLAG (this, FLAG_REMOVED);
1004	INVOKE_OBJECT (REMOVE, this);	1041	INVOKE_OBJECT (REMOVE, this);
		1042
		1043	flag [FLAG_REMOVED] = true;
1005		1044
1006	if (more)	1045	if (more)
1007	more->remove ();	1046	more->remove ();
1008		1047
1009	/*	1048	/*
1010	* In this case, the object to be removed is in someones	1049	* In this case, the object to be removed is in someones
1011	* inventory.	1050	* inventory.
1012	*/	1051	*/
1013	if (env)	1052	if (env)
1014	{	1053	{
1015	if (nrof)	1054	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1016	sub_weight (env, weight * nrof);	1055	if (object *pl = visible_to ())
1017	else	1056	esrv_del_item (pl->contr, count);
1018	sub_weight (env, weight + carrying);	1057	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1058
		1059	adjust_weight (env, -total_weight ());
		1060
		1061	/* we set up values so that it could be inserted into
		1062	* the map, but we don't actually do that - it is up
		1063	* to the caller to decide what we want to do.
		1064	*/
		1065	map = env->map;
		1066	x = env->x;
		1067	y = env->y;
		1068
		1069	// make sure cmov optimisation is applicable
		1070	*(above ? &above->below : &env->inv) = below;
		1071	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1072
		1073	above = 0;
		1074	below = 0;
		1075	env = 0;
1019		1076
1020	/* NO_FIX_PLAYER is set when a great many changes are being	1077	/* NO_FIX_PLAYER is set when a great many changes are being
1021	* made to players inventory. If set, avoiding the call	1078	* made to players inventory. If set, avoiding the call
1022	* to save cpu time.	1079	* to save cpu time.
1023	*/	1080	*/
1024	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1081	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1025	otmp->update_stats ();	1082	otmp->update_stats ();
1026
1027	if (above)
1028	above->below = below;
1029	else
1030	env->inv = below;
1031
1032	if (below)
1033	below->above = above;
1034
1035	/* we set up values so that it could be inserted into
1036	* the map, but we don't actually do that - it is up
1037	* to the caller to decide what we want to do.
1038	*/
1039	x = env->x, y = env->y;
1040	map = env->map;
1041	above = 0, below = 0;
1042	env = 0;
1043	}	1083	}
1044	else if (map)	1084	else if (map)
1045	{	1085	{
1046	if (type == PLAYER)
1047	{
1048	// leaving a spot always closes any open container on the ground
1049	if (container && !container->env)
1050	// this causes spurious floorbox updates, but it ensures
1051	// that the CLOSE event is being sent.
1052	close_container ();
1053
1054	--map->players;
1055	map->touch ();
1056	}
1057
1058	map->dirty = true;	1086	map->dirty = true;
1059	mapspace &ms = this->ms ();	1087	mapspace &ms = this->ms ();
1060		1088
		1089	if (object *pl = ms.player ())
		1090	{
		1091	if (type == PLAYER) // this == pl(!)
		1092	{
		1093	// leaving a spot always closes any open container on the ground
		1094	if (container && !container->env)
		1095	// this causes spurious floorbox updates, but it ensures
		1096	// that the CLOSE event is being sent.
		1097	close_container ();
		1098
		1099	--map->players;
		1100	map->touch ();
		1101	}
		1102	else if (pl->container == this)
		1103	{
		1104	// removing a container should close it
		1105	close_container ();
		1106	}
		1107
		1108	esrv_del_item (pl->contr, count);
		1109	}
		1110
1061	/* link the object above us */	1111	/* link the object above us */
1062	if (above)	1112	// re-link, make sure compiler can easily use cmove
1063	above->below = below;	1113	*(above ? &above->below : &ms.top) = below;
1064	else	1114	*(below ? &below->above : &ms.bot) = above;
1065	ms.top = below; /* we were top, set new top */
1066
1067	/* Relink the object below us, if there is one */
1068	if (below)
1069	below->above = above;
1070	else
1071	{
1072	/* Nothing below, which means we need to relink map object for this space
1073	* use translated coordinates in case some oddness with map tiling is
1074	* evident
1075	*/
1076	if (GET_MAP_OB (map, x, y) != this)
1077	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1078
1079	ms.bot = above; /* goes on above it. */
1080	}
1081		1115
1082	above = 0;	1116	above = 0;
1083	below = 0;	1117	below = 0;
1084		1118
1085	if (map->in_memory == MAP_SAVING)	1119	if (map->in_memory == MAP_SAVING)
1086	return;	1120	return;
1087		1121
1088	int check_walk_off = !flag [FLAG_NO_APPLY];	1122	int check_walk_off = !flag [FLAG_NO_APPLY];
		1123
		1124	if (object *pl = ms.player ())
		1125	{
		1126	if (pl->container == this)
		1127	/* If a container that the player is currently using somehow gets
		1128	* removed (most likely destroyed), update the player view
		1129	* appropriately.
		1130	*/
		1131	pl->close_container ();
		1132
		1133	//TODO: the floorbox prev/next might need updating
		1134	//esrv_del_item (pl->contr, count);
		1135	//TODO: update floorbox to preserve ordering
		1136	if (pl->contr->ns)
		1137	pl->contr->ns->floorbox_update ();
		1138	}
1089		1139
1090	for (tmp = ms.bot; tmp; tmp = tmp->above)	1140	for (tmp = ms.bot; tmp; tmp = tmp->above)
1091	{	1141	{
1092	/* No point updating the players look faces if he is the object	1142	/* No point updating the players look faces if he is the object
1093	* being removed.	1143	* being removed.
1094	*/	1144	*/
1095
1096	if (tmp->type == PLAYER && tmp != this)
1097	{
1098	/* If a container that the player is currently using somehow gets
1099	* removed (most likely destroyed), update the player view
1100	* appropriately.
1101	*/
1102	if (tmp->container == this)
1103	{
1104	flag [FLAG_APPLIED] = 0;
1105	tmp->container = 0;
1106	}
1107
1108	if (tmp->contr->ns)
1109	tmp->contr->ns->floorbox_update ();
1110	}
1111		1145
1112	/* See if object moving off should effect something */	1146	/* See if object moving off should effect something */
1113	if (check_walk_off	1147	if (check_walk_off
1114	&& ((move_type & tmp->move_off)	1148	&& ((move_type & tmp->move_off)
1115	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1149	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1147	merge_ob (object *op, object *top)	1181	merge_ob (object *op, object *top)
1148	{	1182	{
1149	if (!op->nrof)	1183	if (!op->nrof)
1150	return 0;	1184	return 0;
1151		1185
1152	if (top)	1186	if (!top)
1153	for (top = op; top && top->above; top = top->above)	1187	for (top = op; top && top->above; top = top->above)
1154	;	1188	;
1155		1189
1156	for (; top; top = top->below)	1190	for (; top; top = top->below)
1157	{
1158	if (top == op)
1159	continue;
1160
1161	if (object::can_merge (op, top))	1191	if (object::can_merge (op, top))
1162	{	1192	{
1163	top->nrof += op->nrof;	1193	top->nrof += op->nrof;
1164		1194
1165	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1195	if (object *pl = top->visible_to ())
1166	op->weight = 0; /* Don't want any adjustements now */	1196	esrv_update_item (UPD_NROF, pl, top);
		1197
		1198	op->weight = 0; // cancel the addition above
		1199	op->carrying = 0; // must be 0 already
		1200
1167	op->destroy ();	1201	op->destroy (1);
		1202
1168	return top;	1203	return top;
1169	}	1204	}
1170	}
1171		1205
1172	return 0;	1206	return 0;
1173	}	1207	}
1174		1208
1175	void	1209	void
…		…
1200	* job preparing multi-part monsters.	1234	* job preparing multi-part monsters.
1201	*/	1235	*/
1202	object *	1236	object *
1203	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1237	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1204	{	1238	{
		1239	op->remove ();
		1240
1205	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1241	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1206	{	1242	{
1207	tmp->x = x + tmp->arch->x;	1243	tmp->x = x + tmp->arch->x;
1208	tmp->y = y + tmp->arch->y;	1244	tmp->y = y + tmp->arch->y;
1209	}	1245	}
…		…
1232	* just 'op' otherwise	1268	* just 'op' otherwise
1233	*/	1269	*/
1234	object *	1270	object *
1235	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)
1236	{	1272	{
1237	assert (!op->flag [FLAG_FREED]);	1273	if (op->is_on_map ())
1238
1239	object *top, *floor = NULL;
1240
1241	op->remove ();
1242
1243	#if 0
1244	if (!m->active != !op->active)
1245	if (m->active)
1246	op->activate_recursive ();
1247	else
1248	op->deactivate_recursive ();
1249	#endif
1250
1251	if (out_of_map (m, op->x, op->y))
1252	{	1274	{
1253	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());	1275	LOG (llevError, "insert_ob_in_map called for object already on map");
1254	#ifdef MANY_CORES
1255	/* Better to catch this here, as otherwise the next use of this object
1256	* is likely to cause a crash. Better to find out where it is getting
1257	* improperly inserted.
1258	*/
1259	abort ();	1276	abort ();
1260	#endif	1277	}
1261	return op;	1278
		1279	if (op->env)
1262	}	1280	{
		1281	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
		1282	op->remove ();
		1283	}
1263		1284
1264	if (object *more = op->more)	1285	if (op->face && !face_info (op->face))//D TODO: remove soon
1265	if (!insert_ob_in_map (more, m, originator, flag))	1286	{//D
1266	return 0;	1287	LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D
1267		1288	op->face = 1;//D
1268	CLEAR_FLAG (op, FLAG_REMOVED);	1289	}//D
1269		1290
1270	/* Ideally, the caller figures this out. However, it complicates a lot	1291	/* Ideally, the caller figures this out. However, it complicates a lot
1271	* of areas of callers (eg, anything that uses find_free_spot would now	1292	* of areas of callers (eg, anything that uses find_free_spot would now
1272	* need extra work	1293	* need extra work
1273	*/	1294	*/
1274	if (!xy_normalise (m, op->x, op->y))	1295	if (!xy_normalise (m, op->x, op->y))
		1296	{
		1297	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1275	return 0;	1298	return 0;
		1299	}
		1300
		1301	if (object *more = op->more)
		1302	if (!insert_ob_in_map (more, m, originator, flag))
		1303	return 0;
		1304
		1305	CLEAR_FLAG (op, FLAG_REMOVED);
1276		1306
1277	op->map = m;	1307	op->map = m;
1278	mapspace &ms = op->ms ();	1308	mapspace &ms = op->ms ();
1279		1309
1280	/* this has to be done after we translate the coordinates.	1310	/* this has to be done after we translate the coordinates.
1281	*/	1311	*/
1282	if (op->nrof && !(flag & INS_NO_MERGE))	1312	if (op->nrof && !(flag & INS_NO_MERGE))
1283	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1313	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1284	if (object::can_merge (op, tmp))	1314	if (object::can_merge (op, tmp))
1285	{	1315	{
		1316	// TODO: we actually want to update tmp, not op,
		1317	// but some caller surely breaks when we return tmp
		1318	// from here :/
1286	op->nrof += tmp->nrof;	1319	op->nrof += tmp->nrof;
1287	tmp->destroy ();	1320	tmp->destroy (1);
1288	}	1321	}
1289		1322
1290	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1323	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1291	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1324	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1292		1325
…		…
1299	{	1332	{
1300	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1333	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1301	abort ();	1334	abort ();
1302	}	1335	}
1303		1336
		1337	if (!originator->is_on_map ())
		1338	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1339	op->debug_desc (), originator->debug_desc ());
		1340
1304	op->above = originator;	1341	op->above = originator;
1305	op->below = originator->below;	1342	op->below = originator->below;
1306
1307	if (op->below)
1308	op->below->above = op;
1309	else
1310	ms.bot = op;
1311
1312	/* since *below* originator, no need to update top */
1313	originator->below = op;	1343	originator->below = op;
		1344
		1345	*(op->below ? &op->below->above : &ms.bot) = op;
1314	}	1346	}
1315	else	1347	else
1316	{	1348	{
1317	top = ms.bot;	1349	object *floor = 0;
		1350	object *top = ms.top;
1318		1351
1319	/* If there are other objects, then */	1352	/* If there are other objects, then */
1320	if ((!(flag & INS_MAP_LOAD)) && top)	1353	if (top)
1321	{	1354	{
1322	object *last = 0;
1323
1324	/*	1355	/*
1325	* If there are multiple objects on this space, we do some trickier handling.	1356	* If there are multiple objects on this space, we do some trickier handling.
1326	* We've already dealt with merging if appropriate.	1357	* We've already dealt with merging if appropriate.
1327	* Generally, we want to put the new object on top. But if	1358	* Generally, we want to put the new object on top. But if
1328	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1359	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1331	* once we get to them. This reduces the need to traverse over all of	1362	* once we get to them. This reduces the need to traverse over all of
1332	* them when adding another one - this saves quite a bit of cpu time	1363	* them when adding another one - this saves quite a bit of cpu time
1333	* when lots of spells are cast in one area. Currently, it is presumed	1364	* when lots of spells are cast in one area. Currently, it is presumed
1334	* that flying non pickable objects are spell objects.	1365	* that flying non pickable objects are spell objects.
1335	*/	1366	*/
1336	for (top = ms.bot; top; top = top->above)	1367	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1337	{	1368	{
1338	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1369	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1339	floor = top;	1370	floor = tmp;
1340		1371
1341	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1372	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1342	{	1373	{
1343	/* We insert above top, so we want this object below this */	1374	/* We insert above top, so we want this object below this */
1344	top = top->below;	1375	top = tmp->below;
1345	break;	1376	break;
1346	}	1377	}
1347		1378
1348	last = top;	1379	top = tmp;
1349	}	1380	}
1350
1351	/* Don't want top to be NULL, so set it to the last valid object */
1352	top = last;
1353		1381
1354	/* We let update_position deal with figuring out what the space	1382	/* We let update_position deal with figuring out what the space
1355	* looks like instead of lots of conditions here.	1383	* looks like instead of lots of conditions here.
1356	* makes things faster, and effectively the same result.	1384	* makes things faster, and effectively the same result.
1357	*/	1385	*/
…		…
1364	*/	1392	*/
1365	if (!(flag & INS_ON_TOP)	1393	if (!(flag & INS_ON_TOP)
1366	&& ms.flags () & P_BLOCKSVIEW	1394	&& ms.flags () & P_BLOCKSVIEW
1367	&& (op->face && !faces [op->face].visibility))	1395	&& (op->face && !faces [op->face].visibility))
1368	{	1396	{
		1397	object *last;
		1398
1369	for (last = top; last != floor; last = last->below)	1399	for (last = top; last != floor; last = last->below)
1370	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1400	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1371	break;	1401	break;
1372		1402
1373	/* Check to see if we found the object that blocks view,	1403	/* Check to see if we found the object that blocks view,
…		…
1377	*/	1407	*/
1378	if (last && last->below && last != floor)	1408	if (last && last->below && last != floor)
1379	top = last->below;	1409	top = last->below;
1380	}	1410	}
1381	} /* If objects on this space */	1411	} /* If objects on this space */
1382	if (flag & INS_MAP_LOAD)
1383	top = ms.top;
1384		1412
1385	if (flag & INS_ABOVE_FLOOR_ONLY)	1413	if (flag & INS_ABOVE_FLOOR_ONLY)
1386	top = floor;	1414	top = floor;
1387		1415
1388	/* Top is the object that our object (op) is going to get inserted above.	1416	// insert object above top, or bottom-most if top = 0
1389	*/
1390
1391	/* First object on this space */
1392	if (!top)	1417	if (!top)
1393	{	1418	{
		1419	op->below = 0;
1394	op->above = ms.bot;	1420	op->above = ms.bot;
1395
1396	if (op->above)
1397	op->above->below = op;
1398
1399	op->below = 0;
1400	ms.bot = op;	1421	ms.bot = op;
		1422
		1423	*(op->above ? &op->above->below : &ms.top) = op;
1401	}	1424	}
1402	else	1425	else
1403	{ /* get inserted into the stack above top */	1426	{
1404	op->above = top->above;	1427	op->above = top->above;
1405
1406	if (op->above)
1407	op->above->below = op;	1428	top->above = op;
1408		1429
1409	op->below = top;	1430	op->below = top;
1410	top->above = op;	1431	*(op->above ? &op->above->below : &ms.top) = op;
1411	}	1432	}
1412		1433	}
1413	if (!op->above)
1414	ms.top = op;
1415	} /* else not INS_BELOW_ORIGINATOR */
1416		1434
1417	if (op->type == PLAYER)	1435	if (op->type == PLAYER)
1418	{	1436	{
1419	op->contr->do_los = 1;	1437	op->contr->do_los = 1;
1420	++op->map->players;	1438	++op->map->players;
1421	op->map->touch ();	1439	op->map->touch ();
1422	}	1440	}
1423		1441
1424	op->map->dirty = true;	1442	op->map->dirty = true;
1425		1443
1426	/* If we have a floor, we know the player, if any, will be above
1427	* it, so save a few ticks and start from there.
1428	*/
1429	if (!(flag & INS_MAP_LOAD))
1430	if (object *pl = ms.player ())	1444	if (object *pl = ms.player ())
		1445	//TODO: the floorbox prev/next might need updating
		1446	//esrv_send_item (pl, op);
		1447	//TODO: update floorbox to preserve ordering
1431	if (pl->contr->ns)	1448	if (pl->contr->ns)
1432	pl->contr->ns->floorbox_update ();	1449	pl->contr->ns->floorbox_update ();
1433		1450
1434	/* If this object glows, it may affect lighting conditions that are	1451	/* If this object glows, it may affect lighting conditions that are
1435	* visible to others on this map. But update_all_los is really	1452	* visible to others on this map. But update_all_los is really
1436	* an inefficient way to do this, as it means los for all players	1453	* an inefficient way to do this, as it means los for all players
1437	* on the map will get recalculated. The players could very well	1454	* on the map will get recalculated. The players could very well
…		…
1479	* op is the object to insert it under: supplies x and the map.	1496	* op is the object to insert it under: supplies x and the map.
1480	*/	1497	*/
1481	void	1498	void
1482	replace_insert_ob_in_map (const char *arch_string, object *op)	1499	replace_insert_ob_in_map (const char *arch_string, object *op)
1483	{	1500	{
1484	object *tmp, *tmp1;
1485
1486	/* first search for itself and remove any old instances */	1501	/* first search for itself and remove any old instances */
1487		1502
1488	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1503	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1489	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1504	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1490	tmp->destroy ();	1505	tmp->destroy (1);
1491		1506
1492	tmp1 = arch_to_object (archetype::find (arch_string));	1507	object *tmp = arch_to_object (archetype::find (arch_string));
1493		1508
1494	tmp1->x = op->x;	1509	tmp->x = op->x;
1495	tmp1->y = op->y;	1510	tmp->y = op->y;
		1511
1496	insert_ob_in_map (tmp1, op->map, op, 0);	1512	insert_ob_in_map (tmp, op->map, op, 0);
1497	}	1513	}
1498		1514
1499	object *	1515	object *
1500	object::insert_at (object *where, object *originator, int flags)	1516	object::insert_at (object *where, object *originator, int flags)
1501	{	1517	{
		1518	if (where->env)
		1519	return where->env->insert (this);
		1520	else
1502	return where->map->insert (this, where->x, where->y, originator, flags);	1521	return where->map->insert (this, where->x, where->y, originator, flags);
1503	}	1522	}
1504		1523
1505	/*	1524	/*
1506	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1507	* is returned contains nr objects, and the remaining parts contains
1508	* the rest (or is removed and freed if that number is 0).
1509	* On failure, NULL is returned, and the reason put into the
1510	* global static errmsg array.
1511	*/
1512	object *
1513	get_split_ob (object *orig_ob, uint32 nr)
1514	{
1515	object *newob;
1516	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1517
1518	if (orig_ob->nrof < nr)
1519	{
1520	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1521	return NULL;
1522	}
1523
1524	newob = object_create_clone (orig_ob);
1525
1526	if ((orig_ob->nrof -= nr) < 1)
1527	orig_ob->destroy (1);
1528	else if (!is_removed)
1529	{
1530	if (orig_ob->env != NULL)
1531	sub_weight (orig_ob->env, orig_ob->weight * nr);
1532	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1533	{
1534	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1535	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1536	return NULL;
1537	}
1538	}
1539
1540	newob->nrof = nr;
1541
1542	return newob;
1543	}
1544
1545	/*
1546	* decrease_ob_nr(object, number) decreases a specified number from	1525	* decrease(object, number) decreases a specified number from
1547	* the amount of an object. If the amount reaches 0, the object	1526	* the amount of an object. If the amount reaches 0, the object
1548	* is subsequently removed and freed.	1527	* is subsequently removed and freed.
1549	*	1528	*
1550	* Return value: 'op' if something is left, NULL if the amount reached 0	1529	* Return value: 'op' if something is left, NULL if the amount reached 0
1551	*/	1530	*/
		1531	bool
		1532	object::decrease (sint32 nr)
		1533	{
		1534	if (!nr)
		1535	return true;
		1536
		1537	nr = min (nr, nrof);
		1538
		1539	if (nrof > nr)
		1540	{
		1541	nrof -= nr;
		1542	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
		1543
		1544	if (object *pl = visible_to ())
		1545	esrv_update_item (UPD_NROF, pl, this);
		1546
		1547	return true;
		1548	}
		1549	else
		1550	{
		1551	destroy ();
		1552	return false;
		1553	}
		1554	}
		1555
		1556	/*
		1557	* split(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 returned if that number is 0).
		1560	* On failure, NULL is returned.
		1561	*/
1552	object *	1562	object *
1553	decrease_ob_nr (object *op, uint32 i)	1563	object::split (sint32 nr)
1554	{	1564	{
1555	object *tmp;	1565	int have = number_of ();
1556		1566
1557	if (i == 0) /* objects with op->nrof require this check */	1567	if (have < nr)
1558	return op;	1568	return 0;
1559		1569	else if (have == nr)
1560	if (i > op->nrof)
1561	i = op->nrof;
1562
1563	if (QUERY_FLAG (op, FLAG_REMOVED))
1564	op->nrof -= i;
1565	else if (op->env)
1566	{	1570	{
1567	/* is this object in the players inventory, or sub container
1568	* therein?
1569	*/
1570	tmp = op->in_player ();
1571	/* nope. Is this a container the player has opened?
1572	* If so, set tmp to that player.
1573	* IMO, searching through all the players will mostly
1574	* likely be quicker than following op->env to the map,
1575	* and then searching the map for a player.
1576	*/
1577	if (!tmp)
1578	for_all_players (pl)
1579	if (pl->ob->container == op->env)
1580	{
1581	tmp = pl->ob;
1582	break;
1583	}
1584
1585	if (i < op->nrof)
1586	{
1587	sub_weight (op->env, op->weight * i);
1588	op->nrof -= i;
1589	if (tmp)
1590	esrv_send_item (tmp, op);
1591	}
1592	else
1593	{
1594	op->remove ();	1571	remove ();
1595	op->nrof = 0;	1572	return this;
1596	if (tmp)
1597	esrv_del_item (tmp->contr, op->count);
1598	}
1599	}	1573	}
1600	else	1574	else
1601	{	1575	{
1602	object *above = op->above;	1576	decrease (nr);
1603		1577
1604	if (i < op->nrof)	1578	object *op = deep_clone ();
1605	op->nrof -= i;	1579	op->nrof = nr;
1606	else
1607	{
1608	op->remove ();
1609	op->nrof = 0;
1610	}
1611
1612	/* Since we just removed op, op->above is null */
1613	for (tmp = above; tmp; tmp = tmp->above)
1614	if (tmp->type == PLAYER)
1615	{
1616	if (op->nrof)
1617	esrv_send_item (tmp, op);
1618	else
1619	esrv_del_item (tmp->contr, op->count);
1620	}
1621	}
1622
1623	if (op->nrof)
1624	return op;	1580	return op;
1625	else
1626	{
1627	op->destroy ();
1628	return 0;
1629	}
1630	}
1631
1632	/*
1633	* add_weight(object, weight) adds the specified weight to an object,
1634	* and also updates how much the environment(s) is/are carrying.
1635	*/
1636	void
1637	add_weight (object *op, signed long weight)
1638	{
1639	while (op != NULL)
1640	{
1641	if (op->type == CONTAINER)
1642	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1643
1644	op->carrying += weight;
1645	op = op->env;
1646	}	1581	}
1647	}	1582	}
1648		1583
1649	object *	1584	object *
1650	insert_ob_in_ob (object *op, object *where)	1585	insert_ob_in_ob (object *op, object *where)
…		…
1675	* be != op, if items are merged. -Tero	1610	* be != op, if items are merged. -Tero
1676	*/	1611	*/
1677	object *	1612	object *
1678	object::insert (object *op)	1613	object::insert (object *op)
1679	{	1614	{
1680	object *tmp, *otmp;
1681
1682	if (!QUERY_FLAG (op, FLAG_REMOVED))
1683	op->remove ();
1684
1685	if (op->more)	1615	if (op->more)
1686	{	1616	{
1687	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1617	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1688	return op;	1618	return op;
1689	}	1619	}
1690		1620
1691	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1621	op->remove ();
1692	CLEAR_FLAG (op, FLAG_REMOVED);	1622
		1623	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1624
1693	if (op->nrof)	1625	if (op->nrof)
1694	{
1695	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1626	for (object *tmp = inv; tmp; tmp = tmp->below)
1696	if (object::can_merge (tmp, op))	1627	if (object::can_merge (tmp, op))
1697	{	1628	{
1698	/* return the original object and remove inserted object	1629	/* return the original object and remove inserted object
1699	(client needs the original object) */	1630	(client needs the original object) */
1700	tmp->nrof += op->nrof;	1631	tmp->nrof += op->nrof;
1701	/* Weight handling gets pretty funky. Since we are adding to	1632
1702	* tmp->nrof, we need to increase the weight.	1633	if (object *pl = tmp->visible_to ())
1703	*/	1634	esrv_update_item (UPD_NROF, pl, tmp);
		1635
1704	add_weight (this, op->weight * op->nrof);	1636	adjust_weight (this, op->total_weight ());
1705	SET_FLAG (op, FLAG_REMOVED);	1637
1706	op->destroy (); /* free the inserted object */	1638	op->destroy (1);
1707	op = tmp;	1639	op = tmp;
1708	op->remove (); /* and fix old object's links */	1640	goto inserted;
1709	CLEAR_FLAG (op, FLAG_REMOVED);
1710	break;
1711	}	1641	}
1712		1642
1713	/* I assume combined objects have no inventory	1643	op->owner = 0; // it's his/hers now. period.
1714	* We add the weight - this object could have just been removed
1715	* (if it was possible to merge). calling remove_ob will subtract
1716	* the weight, so we need to add it in again, since we actually do
1717	* the linking below
1718	*/
1719	add_weight (this, op->weight * op->nrof);
1720	}
1721	else
1722	add_weight (this, (op->weight + op->carrying));
1723
1724	otmp = this->in_player ();
1725	if (otmp && otmp->contr)
1726	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1727	otmp->update_stats ();
1728
1729	op->map = 0;	1644	op->map = 0;
1730	op->env = this;	1645	op->x = 0;
		1646	op->y = 0;
		1647
1731	op->above = 0;	1648	op->above = 0;
1732	op->below = 0;	1649	op->below = inv;
1733	op->x = 0, op->y = 0;	1650	op->env = this;
1734		1651
		1652	if (inv)
		1653	inv->above = op;
		1654
		1655	inv = op;
		1656
		1657	op->flag [FLAG_REMOVED] = 0;
		1658
		1659	if (object *pl = op->visible_to ())
		1660	esrv_send_item (pl, op);
		1661
		1662	adjust_weight (this, op->total_weight ());
		1663
		1664	inserted:
1735	/* reset the light list and los of the players on the map */	1665	/* reset the light list and los of the players on the map */
1736	if ((op->glow_radius != 0) && map)	1666	if (op->glow_radius && map && map->darkness)
1737	{
1738	#ifdef DEBUG_LIGHTS
1739	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1740	#endif /* DEBUG_LIGHTS */
1741	if (map->darkness)
1742	update_all_los (map, x, y);	1667	update_all_los (map, x, y);
1743	}
1744		1668
1745	/* Client has no idea of ordering so lets not bother ordering it here.	1669	// if this is a player's inventory, update stats
1746	* It sure simplifies this function...	1670	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1747	*/	1671	update_stats ();
1748	if (!inv)
1749	inv = op;
1750	else
1751	{
1752	op->below = inv;
1753	op->below->above = op;
1754	inv = op;
1755	}
1756		1672
1757	INVOKE_OBJECT (INSERT, this);	1673	INVOKE_OBJECT (INSERT, this);
1758		1674
1759	return op;	1675	return op;
1760	}	1676	}
…		…
1888	LOG (llevError, "Present_arch called outside map.\n");	1804	LOG (llevError, "Present_arch called outside map.\n");
1889	return NULL;	1805	return NULL;
1890	}	1806	}
1891		1807
1892	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1808	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1893	if (tmp->arch == at)	1809	if (tmp->arch->archname == at->archname)
1894	return tmp;	1810	return tmp;
1895		1811
1896	return NULL;	1812	return NULL;
1897	}	1813	}
1898		1814
…		…
1962	* The first matching object is returned, or NULL if none.	1878	* The first matching object is returned, or NULL if none.
1963	*/	1879	*/
1964	object *	1880	object *
1965	present_arch_in_ob (const archetype *at, const object *op)	1881	present_arch_in_ob (const archetype *at, const object *op)
1966	{	1882	{
1967	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1883	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1968	if (tmp->arch == at)	1884	if (tmp->arch->archname == at->archname)
1969	return tmp;	1885	return tmp;
1970		1886
1971	return NULL;	1887	return NULL;
1972	}	1888	}
1973		1889
…		…
1975	* activate recursively a flag on an object inventory	1891	* activate recursively a flag on an object inventory
1976	*/	1892	*/
1977	void	1893	void
1978	flag_inv (object *op, int flag)	1894	flag_inv (object *op, int flag)
1979	{	1895	{
1980	if (op->inv)
1981	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1896	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1982	{	1897	{
1983	SET_FLAG (tmp, flag);	1898	SET_FLAG (tmp, flag);
1984	flag_inv (tmp, flag);	1899	flag_inv (tmp, flag);
1985	}	1900	}
1986	}	1901	}
1987		1902
1988	/*	1903	/*
1989	* deactivate recursively a flag on an object inventory	1904	* deactivate recursively a flag on an object inventory
1990	*/	1905	*/
1991	void	1906	void
1992	unflag_inv (object *op, int flag)	1907	unflag_inv (object *op, int flag)
1993	{	1908	{
1994	if (op->inv)
1995	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1909	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1996	{	1910	{
1997	CLEAR_FLAG (tmp, flag);	1911	CLEAR_FLAG (tmp, flag);
1998	unflag_inv (tmp, flag);	1912	unflag_inv (tmp, flag);
1999	}	1913	}
2000	}	1914	}
2001		1915
2002	/*	1916	/*
2003	* find_free_spot(object, map, x, y, start, stop) will search for	1917	* find_free_spot(object, map, x, y, start, stop) will search for
2004	* a spot at the given map and coordinates which will be able to contain	1918	* a spot at the given map and coordinates which will be able to contain
…		…
2006	* to search (see the freearr_x/y[] definition).	1920	* to search (see the freearr_x/y[] definition).
2007	* It returns a random choice among the alternatives found.	1921	* It returns a random choice among the alternatives found.
2008	* start and stop are where to start relative to the free_arr array (1,9	1922	* start and stop are where to start relative to the free_arr array (1,9
2009	* does all 4 immediate directions). This returns the index into the	1923	* does all 4 immediate directions). This returns the index into the
2010	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1924	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2011	* Note - this only checks to see if there is space for the head of the
2012	* object - if it is a multispace object, this should be called for all
2013	* pieces.
2014	* Note2: This function does correctly handle tiled maps, but does not	1925	* Note: This function does correctly handle tiled maps, but does not
2015	* inform the caller. However, insert_ob_in_map will update as	1926	* inform the caller. However, insert_ob_in_map will update as
2016	* necessary, so the caller shouldn't need to do any special work.	1927	* necessary, so the caller shouldn't need to do any special work.
2017	* Note - updated to take an object instead of archetype - this is necessary	1928	* Note - updated to take an object instead of archetype - this is necessary
2018	* because arch_blocked (now ob_blocked) needs to know the movement type	1929	* because arch_blocked (now ob_blocked) needs to know the movement type
2019	* to know if the space in question will block the object. We can't use	1930	* to know if the space in question will block the object. We can't use
…		…
2021	* customized, changed states, etc.	1932	* customized, changed states, etc.
2022	*/	1933	*/
2023	int	1934	int
2024	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1935	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2025	{	1936	{
		1937	int altern[SIZEOFFREE];
2026	int index = 0, flag;	1938	int index = 0, flag;
2027	int altern[SIZEOFFREE];
2028		1939
2029	for (int i = start; i < stop; i++)	1940	for (int i = start; i < stop; i++)
2030	{	1941	{
2031	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1942	mapxy pos (m, x, y); pos.move (i);
2032	if (!flag)	1943
		1944	if (!pos.normalise ())
		1945	continue;
		1946
		1947	mapspace &ms = *pos;
		1948
		1949	if (ms.flags () & P_IS_ALIVE)
		1950	continue;
		1951
		1952	/* However, often
		1953	* ob doesn't have any move type (when used to place exits)
		1954	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1955	*/
		1956	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1957	{
2033	altern [index++] = i;	1958	altern [index++] = i;
		1959	continue;
		1960	}
2034		1961
2035	/* Basically, if we find a wall on a space, we cut down the search size.	1962	/* Basically, if we find a wall on a space, we cut down the search size.
2036	* In this way, we won't return spaces that are on another side of a wall.	1963	* In this way, we won't return spaces that are on another side of a wall.
2037	* This mostly work, but it cuts down the search size in all directions -	1964	* This mostly work, but it cuts down the search size in all directions -
2038	* if the space being examined only has a wall to the north and empty	1965	* if the space being examined only has a wall to the north and empty
2039	* spaces in all the other directions, this will reduce the search space	1966	* spaces in all the other directions, this will reduce the search space
2040	* to only the spaces immediately surrounding the target area, and	1967	* to only the spaces immediately surrounding the target area, and
2041	* won't look 2 spaces south of the target space.	1968	* won't look 2 spaces south of the target space.
2042	*/	1969	*/
2043	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1970	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1971	{
2044	stop = maxfree[i];	1972	stop = maxfree[i];
		1973	continue;
		1974	}
		1975
		1976	/* Note it is intentional that we check ob - the movement type of the
		1977	* head of the object should correspond for the entire object.
		1978	*/
		1979	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1980	continue;
		1981
		1982	if (ob->blocked (m, pos.x, pos.y))
		1983	continue;
		1984
		1985	altern [index++] = i;
2045	}	1986	}
2046		1987
2047	if (!index)	1988	if (!index)
2048	return -1;	1989	return -1;
2049		1990
…		…
2058	*/	1999	*/
2059	int	2000	int
2060	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2001	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2061	{	2002	{
2062	for (int i = 0; i < SIZEOFFREE; i++)	2003	for (int i = 0; i < SIZEOFFREE; i++)
2063	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2004	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2064	return i;	2005	return i;
2065		2006
2066	return -1;	2007	return -1;
2067	}	2008	}
2068		2009
…		…
2345	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2286	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2346	* core dumps if they do.	2287	* core dumps if they do.
2347	*	2288	*
2348	* Add a check so we can't pick up invisible objects (0.93.8)	2289	* Add a check so we can't pick up invisible objects (0.93.8)
2349	*/	2290	*/
2350
2351	int	2291	int
2352	can_pick (const object *who, const object *item)	2292	can_pick (const object *who, const object *item)
2353	{	2293	{
2354	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2294	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2355	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2295	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2358		2298
2359	/*	2299	/*
2360	* create clone from object to another	2300	* create clone from object to another
2361	*/	2301	*/
2362	object *	2302	object *
2363	object_create_clone (object *asrc)	2303	object::deep_clone ()
2364	{	2304	{
2365	object *dst = 0, *tmp, *src, *prev, *item;	2305	assert (("deep_clone called on non-head object", is_head ()));
2366		2306
2367	if (!asrc)	2307	object *dst = clone ();
2368	return 0;
2369		2308
2370	src = asrc->head_ ();	2309	object *prev = dst;
2371
2372	prev = 0;
2373	for (object *part = src; part; part = part->more)	2310	for (object *part = this->more; part; part = part->more)
2374	{	2311	{
2375	tmp = part->clone ();	2312	object *tmp = part->clone ();
2376	tmp->x -= src->x;
2377	tmp->y -= src->y;
2378
2379	if (!part->head)
2380	{
2381	dst = tmp;
2382	tmp->head = 0;
2383	}
2384	else
2385	tmp->head = dst;	2313	tmp->head = dst;
2386
2387	tmp->more = 0;
2388
2389	if (prev)
2390	prev->more = tmp;	2314	prev->more = tmp;
2391
2392	prev = tmp;	2315	prev = tmp;
2393	}	2316	}
2394		2317
2395	for (item = src->inv; item; item = item->below)	2318	for (object *item = inv; item; item = item->below)
2396	insert_ob_in_ob (object_create_clone (item), dst);	2319	insert_ob_in_ob (item->deep_clone (), dst);
2397		2320
2398	return dst;	2321	return dst;
2399	}	2322	}
2400		2323
2401	/* This returns the first object in who's inventory that	2324	/* This returns the first object in who's inventory that
…		…
2410	return tmp;	2333	return tmp;
2411		2334
2412	return 0;	2335	return 0;
2413	}	2336	}
2414		2337
2415	/* If ob has a field named key, return the link from the list,	2338	const shstr &
2416	* otherwise return NULL.	2339	object::kv_get (const shstr &key) const
2417	*
2418	* key must be a passed in shared string - otherwise, this won't
2419	* do the desired thing.
2420	*/
2421	key_value *
2422	get_ob_key_link (const object *ob, const char *key)
2423	{	2340	{
2424	for (key_value *link = ob->key_values; link; link = link->next)	2341	for (key_value *kv = key_values; kv; kv = kv->next)
2425	if (link->key == key)	2342	if (kv->key == key)
2426	return link;
2427
2428	return 0;
2429	}
2430
2431	/*
2432	* Returns the value of op has an extra_field for key, or NULL.
2433	*
2434	* The argument doesn't need to be a shared string.
2435	*
2436	* The returned string is shared.
2437	*/
2438	const char *
2439	get_ob_key_value (const object *op, const char *const key)
2440	{
2441	key_value *link;
2442	shstr_cmp canonical_key (key);
2443
2444	if (!canonical_key)
2445	{
2446	/* 1. There being a field named key on any object
2447	* implies there'd be a shared string to find.
2448	* 2. Since there isn't, no object has this field.
2449	* 3. Therefore, *this* object doesn't have this field.
2450	*/
2451	return 0;
2452	}
2453
2454	/* This is copied from get_ob_key_link() above -
2455	* only 4 lines, and saves the function call overhead.
2456	*/
2457	for (link = op->key_values; link; link = link->next)
2458	if (link->key == canonical_key)
2459	return link->value;	2343	return kv->value;
2460		2344
2461	return 0;	2345	return shstr_null;
2462	}	2346	}
2463		2347
2464	/*	2348	void
2465	* Updates the canonical_key in op to value.	2349	object::kv_set (const shstr &key, const shstr &value)
2466	*
2467	* canonical_key is a shared string (value doesn't have to be).
2468	*
2469	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2470	* keys.
2471	*
2472	* Returns TRUE on success.
2473	*/
2474	int
2475	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2476	{	2350	{
2477	key_value *field = NULL, *last = NULL;	2351	for (key_value *kv = key_values; kv; kv = kv->next)
2478		2352	if (kv->key == key)
2479	for (field = op->key_values; field != NULL; field = field->next)
2480	{
2481	if (field->key != canonical_key)
2482	{	2353	{
2483	last = field;	2354	kv->value = value;
2484	continue;	2355	return;
2485	}	2356	}
2486		2357
2487	if (value)	2358	key_value *kv = new key_value;
2488	field->value = value;	2359
2489	else	2360	kv->next = key_values;
		2361	kv->key = key;
		2362	kv->value = value;
		2363
		2364	key_values = kv;
		2365	}
		2366
		2367	void
		2368	object::kv_del (const shstr &key)
		2369	{
		2370	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2371	if ((*kvp)->key == key)
2490	{	2372	{
2491	/* Basically, if the archetype has this key set,	2373	key_value *kv = *kvp;
2492	* we need to store the null value so when we save	2374	*kvp = (*kvp)->next;
2493	* it, we save the empty value so that when we load,	2375	delete kv;
2494	* we get this value back again.	2376	return;
2495	*/
2496	if (get_ob_key_link (op->arch, canonical_key))
2497	field->value = 0;
2498	else
2499	{
2500	if (last)
2501	last->next = field->next;
2502	else
2503	op->key_values = field->next;
2504
2505	delete field;
2506	}
2507	}	2377	}
2508	return TRUE;
2509	}
2510	/* IF we get here, key doesn't exist */
2511
2512	/* No field, we'll have to add it. */
2513
2514	if (!add_key)
2515	return FALSE;
2516
2517	/* There isn't any good reason to store a null
2518	* value in the key/value list. If the archetype has
2519	* this key, then we should also have it, so shouldn't
2520	* be here. If user wants to store empty strings,
2521	* should pass in ""
2522	*/
2523	if (value == NULL)
2524	return TRUE;
2525
2526	field = new key_value;
2527
2528	field->key = canonical_key;
2529	field->value = value;
2530	/* Usual prepend-addition. */
2531	field->next = op->key_values;
2532	op->key_values = field;
2533
2534	return TRUE;
2535	}
2536
2537	/*
2538	* Updates the key in op to value.
2539	*
2540	* If add_key is FALSE, this will only update existing keys,
2541	* and not add new ones.
2542	* In general, should be little reason FALSE is ever passed in for add_key
2543	*
2544	* Returns TRUE on success.
2545	*/
2546	int
2547	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2548	{
2549	shstr key_ (key);
2550
2551	return set_ob_key_value_s (op, key_, value, add_key);
2552	}	2378	}
2553		2379
2554	object::depth_iterator::depth_iterator (object *container)	2380	object::depth_iterator::depth_iterator (object *container)
2555	: iterator_base (container)	2381	: iterator_base (container)
2556	{	2382	{
…		…
2606	{	2432	{
2607	char flagdesc[512];	2433	char flagdesc[512];
2608	char info2[256 * 4];	2434	char info2[256 * 4];
2609	char *p = info;	2435	char *p = info;
2610		2436
2611	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2437	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2612	count, uuid.seq,	2438	count,
		2439	uuid.c_str (),
2613	&name,	2440	&name,
2614	title ? "\",title:\"" : "",	2441	title ? ",title:\"" : "",
2615	title ? (const char *)title : "",	2442	title ? (const char *)title : "",
		2443	title ? "\"" : "",
2616	flag_desc (flagdesc, 512), type);	2444	flag_desc (flagdesc, 512), type);
2617		2445
2618	if (env)	2446	if (!flag[FLAG_REMOVED] && env)
2619	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2447	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2620		2448
2621	if (map)	2449	if (map)
2622	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2450	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2623		2451
…		…
2653	object::open_container (object *new_container)	2481	object::open_container (object *new_container)
2654	{	2482	{
2655	if (container == new_container)	2483	if (container == new_container)
2656	return;	2484	return;
2657		2485
2658	if (object *old_container = container)	2486	object *old_container = container;
		2487
		2488	if (old_container)
2659	{	2489	{
2660	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2490	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2661	return;	2491	return;
2662		2492
2663	#if 0	2493	#if 0
…		…
2665	if (object *closer = old_container->inv)	2495	if (object *closer = old_container->inv)
2666	if (closer->type == CLOSE_CON)	2496	if (closer->type == CLOSE_CON)
2667	closer->destroy ();	2497	closer->destroy ();
2668	#endif	2498	#endif
2669		2499
		2500	// make sure the container is available
		2501	esrv_send_item (this, old_container);
		2502
2670	old_container->flag [FLAG_APPLIED] = 0;	2503	old_container->flag [FLAG_APPLIED] = false;
2671	container = 0;	2504	container = 0;
2672		2505
		2506	// client needs item update to make it work, client bug requires this to be separate
2673	esrv_update_item (UPD_FLAGS, this, old_container);	2507	esrv_update_item (UPD_FLAGS, this, old_container);
		2508
2674	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2509	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2510	play_sound (sound_find ("chest_close"));
2675	}	2511	}
2676		2512
2677	if (new_container)	2513	if (new_container)
2678	{	2514	{
2679	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2515	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2690	}	2526	}
2691	#endif	2527	#endif
2692		2528
2693	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2529	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2694		2530
		2531	// make sure the container is available, client bug requires this to be separate
		2532	esrv_send_item (this, new_container);
		2533
2695	new_container->flag [FLAG_APPLIED] = 1;	2534	new_container->flag [FLAG_APPLIED] = true;
2696	container = new_container;	2535	container = new_container;
2697		2536
		2537	// client needs flag change
2698	esrv_update_item (UPD_FLAGS, this, new_container);	2538	esrv_update_item (UPD_FLAGS, this, new_container);
2699	esrv_send_inventory (this, new_container);	2539	esrv_send_inventory (this, new_container);
		2540	play_sound (sound_find ("chest_open"));
2700	}	2541	}
		2542	// else if (!old_container->env && contr && contr->ns)
		2543	// contr->ns->floorbox_reset ();
2701	}	2544	}
2702		2545
2703	object *	2546	object *
2704	object::force_find (const shstr name)	2547	object::force_find (const shstr name)
2705	{	2548	{
…		…
2731		2574
2732	insert (force);	2575	insert (force);
2733	}	2576	}
2734		2577
2735	void	2578	void
2736	object::play_sound (faceidx sound) const	2579	object::play_sound (faceidx sound)
2737	{	2580	{
2738	if (map)	2581	if (!sound)
		2582	return;
		2583
		2584	if (flag [FLAG_REMOVED])
		2585	return;
		2586
		2587	if (env)
		2588	{
		2589	if (object *pl = in_player ())
		2590	pl->contr->play_sound (sound);
		2591	}
		2592	else
2739	map->play_sound (sound, x, y);	2593	map->play_sound (sound, x, y);
2740	}	2594	}
		2595

Diff Legend

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