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.162 by root, Sat Jun 16 00:12:20 2007 UTC vs.
Revision 1.256 by root, Sun Aug 31 05:47:14 2008 UTC

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

Diff Legend

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